a) Consider an unsorted array of elements {25, 17, 36, 2, 3, 100, 1, 19, 7}: i) Show how to get the first four sorted numbers when applying Selection sort and Insertion sort. ii) Show how to get the first two partitions for the above array when Quicksort is applied. iii) Show the steps to search for 25 in the above sequence using binary search algorithm.

a) Consider an unsorted array of elements {25, 17, 36, 2, 3, 100, 1, 19, 7}: i) Show how to get the first four sorted numbers when applying Selection sort and Insertion sort. ii) Show how to get the first two partitions for the above array when Quicksort is applied. iii) Show the steps to search for 25 in the above sequence using binary search algorithm.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section7.3: Declaring And Processing Two-dimensional Arrays

Problem 3E: (Practice) a. Write a C++ program that adds the values of all elements in the val array used in...

See similar textbooks

Similar questions

(Practice) a. Write a C++ program that adds the values of all elements in the val array used in Exercise 2 and displays the total. b. Modify the program written for Exercise 3a to display the total of each row separately.
1-Write a C++ program to input elements in array and sort array elements in descending order. How to sort array in descending order in using pointers.Use function to print out the original and sorted arrays, Example Input Input size of array: 10 Input array elements: 20, 2, 10, 6, 52, 31, 0, 45, 79, 40 Output Array sorted in descending order: 79 ,52,45,40,31,20,10,6,2,0
Consider an unsorted array of elements {25, 17, 36, 2, 3, 100, 1, 19, 7}:i) Show how to get the first four sorted numbers when applying Selection sort and Insertion sort.ii) Show how to get the first two partitions for the above array when Quicksort is applied.iii) Show the steps to search for 25 in the above sequence using binary search algorithm.iv) Write a C++ program to search for 17 in the above sequence using linear searching algorithm.
Write a C++ program to find the number of comparisons using binarySearch and the sequintial search algorithm as follows:Suppose list is an array of 1000 elements.1.1 Use a random number generator to fill list.1.2 Use any sorting algorithm to sort the list.1.3 Search list for some items as follows:a. Use the binary search algorithm to searcg the list. (You may need to modify the algorithm to count the number of comparisons.b. Use the binary search algorithm to search the list, switching to a sequentialsearch when the size of the search list reduces to less than 15. (Use the sequential search algorithm for a sorted list.)Print the number of comparisons for Questions 1.3a and b. If the item is found in the list, then print its position.
5. Using c++, Write a function that determines the index of the second to the last occurrence of a target b in an integer array a. Return -1 if b is not in a or there is only 1 occurrence of b in a.
Below are some statements about Quicksort and Heapsort. Which of the statements is correct when sorting a large number of elements? A. Heapsort and Quicksort have the same time complexity in the mean case.B. When implementing Quicksort, an extra array is usually used in addition to the one on which the sorting is performed.C. If the first element is selected as the pivot element at Quicksort, Quicksort will be faster than Heapsort when the sequence to be sorted is already almost sorted.D. Heapsort performs the sorting on linear time at its best. Group of answer options All statements except B are correct Only statements A and C are correct Only statement A is correct All statements except D are correct All statements are correct
Create a C Program for this problem.You are to read 10 numbers from a data file into an array named List. Create another 10 element array named Reverse that is to contain the same items as List but in reverse order. For example, the first element in List will be placed in the last position of Reverse, the second element in List will be placed in the second-to-last position in Reverse, etc. After Reverse has been created, output the contents of both arrays.
1. (a) Write a recursive o function for performing binary search on an array of integer. Show how to use this function with sample call from main(). For an input array A={2,6,8,14, 18, 19,37,46, 77}, show each step of algorithm when searching for the value (i) 46 (ii) 17 in the array. (b) Give a structure for storing a active COVID cases in a state. It should consist of the state name (20 characters)and number of active COVID 19 cases (integers) in each state. Each of the 250 students of Btech 1st year (all sections). Inside main () create and array of structure type for holding this information. Write a function that sorts this array in ascending order of active COVID 19 cases, so that we can rank the states in order of the number of cases in each state of the country. (c) Write a function called input() that reads the content of 2-D array( A matrix) row by row. Write a second C function called mult() that takes two matrices and their dimensions as argument and computes. Their…
Problem 6: Suppose you are given an unsorted array A of all integers in the range 0 ton except for one integer, called the missing number. Assume n = 2k − 1. Using the divideand conquer strategy design an O(n)-algorithm to find the missing number.
4. b. If A is an array of integers with width = 4; Please translate withthree-address statement, the following expression: x = a[i] + 2;
1) Write the following C programs (Note : The use of flag or bool is not allowed) a.) A C program to get the largest element in an array using function.b.) Write a function double power (double x, int n) that will compute (xn)
Hello, in C++ I need to solve this problem. *NOTE: The code must be able to read an input file, not individual user inputs of passwords. PROBLEM: Given a file of unsorted words with mixed case: read the entries in the file and sort those words into alphabetical order. The program should then prompt the user for an index, and display the word at that index. Since you must store the entire list in an array, you will need to know the length. The "List of 1000 Mixed Case Words" contains 1000 words. Note that some of these "words" have spaces, so read them one line at a time. You are guaranteed that the words in the array are unique, so you don't have to worry about the order of, say, "bat" and "Bat." For example, if the array contains ten words and the contents are cat Rat bat Mat SAT vat Hat pat TAT eat the sorted list is bat cat eat Hat Mat pat Rat SAT TAT vat and after sorting, the word at index 6 is Rat You are encouraged to use this data to test your program.