1.) Suppose that you sort a large array of integers by using a merge sort. Next you use a binary search to determine whether a given integer occurs in the array. Finally, you display all of the integers in the sorted array.   a.) Which algorithm is faster, in general: the merge sort or the binary search? Explain in terms of Big O notation.   b.) Which algorithm is faster, in general: the binary search or displaying the integers? Explain in terms of Big O notation

Q: solve in python coding 3. Selection Sort • The idea in a selection sort is that you locate the…

A: CODE: def index(array,step,size,min_index):    for i in range(step + 1, size):        if array[i]…

Q: Exercise 1: Pre-sorting Consider the problem of finding the distance between the two closest numbers…

A: solution

Q: MUST USE PYTHON You have a list of elements and their prices. Select your preferred lists from…

A: Here is the python code and output of above problem. See below step.

Q: program that compares all four advanced sorting algorithms . To perform the tests, create a randomly…

A: program in Python that compares the four advanced sorting algorithms (Merge Sort, Quick Sort, Heap…

Q: Assume the following list is being sorted using the Quick Sort algorithm. Describe the next step in…

A: The Answer is in given below steps

Q: Assume nums is a sorted array containing 4000 integers. We want to search for the value -5, but that…

A: Linear Search : When the item is searched in the array with the help of linear search, then the…

Q: orting Consider the following array of int values. [17, 11, 6, 22, -3, 8, 4, 22, 2, 35, -4, 10] a.…

A: Actually, array is an collection of elements.

Q: Assume the following list is being sorted using the Quick Sort algorithm. Describe the next step in…

A:

Q: What is the time complexity for the following code/program?   1.5 A binary search works like this:…

A: A binary search tree is an advanced algorithm used to analyze a node, its left and right branches,…

Q: You need to store a list of students' name an the data structure you can use to achieve this? Sel A.…

A: Please find the following answers with explanation:

Q: comparisons for sorting array of length n using the selection sort algorithm and when does it happen…

A: minimum number of camparision for sorting an array of lenght n using selection sort

Q: Select all the statements that are false, bubble sort is defined below:*             Quicksort is…

A: Selection sort has the worst space complexity among all the sorting algorithm it is incorrect since…

Q: Apply the merge sort on the following list and sort the list in decreasing order: 47 98 29 33 93 98…

A: NOTE - I have used C++ programing language to solve the problem. Here I have defined the recursive…

Q: Write an algorithm to sort elements in an array with selection sort in pseudocode. You will be given…

A: Algorithm for Selection Sort: 1.If the length of the array is less than 2, return the array. 2.For i…