1. Given a set of numbers: A = {3, 41, 52, 26, 38, 57, 9, 49}. a) Use merge-sort to sort the array. Show each step. b) Use quick-sort to sort the array. Show each step. c) How many "comparisons” for each algorithm above? 2. Use binary-search for finding the number 38 for the sorted array based on Question 1, show each step. 3. The time complexity equation of merger-sort is T(n) = 2* T(n/2) + n, where T(1) = C and C is a constant. Solve this equation by giving detailed steps. (Hint: See lecture notes) If you have an equation like the following T(n) = 3* T(n/3) + n, where T(1)=T(2)=C, what would be T(n)?

Q: Code in Python Q) Write a function to sort given array using Insertion sort algorithm and returns…

A: A function to sort given array using Insertion sort algorithm and returns the sorted array :- #…

Q: Sort the following array contents in ascending order. 28 45 -40 -3 3 Give the answers for the…

A: In the image below you can see how array as be changed after every iteration it's shows it steps and…

Q: 12) How many passes will it take in all for Selection Sort to sort this array? a) 2 b) 4 c) 5 d) 6…

A: please see the next step for solution

Q: 4. Use Merge Sort to sort the following numbers by showing the list obtained in each step during the…

A: a. 4,2,6,8,5  b. 3,12,7,1,5

Q: Q1- Given the array a=[10,13,16,18,22,30], how many comparisons binary search algorithm performs to…

A: Q1. in Binary search, 16 will be taken as mid point. as 22>16, the search works on right sub…

Q: Binary Search algorithm uses the divide-and-conquer technique to find elements in O(logn) steps.…

A: Binary Search Pseudocode   Procedure binary_search A ← sorted array n ← size of array x ←…

Q: Question 1 200-500 words per discussion and avoid plagiarism.a. Write down the algorithm for linear…

A: Note: In the BNED Guidance, only the first question can be answered at a time. Resend the question…

Q: Let the array A={50,40,30,20,10} and we wan to sort it in ascending way using insertion sort then…

A: Insertion sort: - It is a basic algorithm to sort the list that operates in a similar way to how the…

Q: What additional requirement is placed on an array, so that binary search may be used to locate an…

A: a)The array elements must form a heap.

Q: Given the following array: 4 15 8 3 287 Write the order of the values in the array after the second…

A: Note: This is a multiple-question-based problem. As per company guidelines, only the first question…

Q: Trace each pass of selection, insertion, bubble and quick sort for the list of values below. For…

A: The answer is written in step 2

Q: Let the array A={50,40,30,20,10} and we wan to sort it in ascending way using insertion sort then…

A: solution  A sublist (or sorted array ) is maintained which is always sorted  Not suitable for large…

Q: Q NO: 5 Given the array of natural numbers below i. What is the precondition to perform jump search?…

A:

Q: (k) Write an algorithm using counting sort to sort an array of integers in the range [-k, k]. You…

A: The solution to the given question is: countingSort(array, size) :        Initializing neg_arr[k] ,…

Q: For each statement below, indicate whether you think it is True or False. If you like, you can…

A: Write true or false for the above-given sentences and give the description for the above true and…

Q: The following array of integers are to be sorted into ascending order: 42108612 If selection sort is…

A: Kindly Note: As per our guidelines we are supposed to answer only first question. Kindly repost…

Q: 1. Show the steps of INSERTION SORT for the following array. S 0 R T I N G

A: We are given an array and we are going to sort it using the insertion sort. Insertion sort: In…

Q: Suppose you are given an array A of n Your task is to sort n numbers stored in array A by reading…

A: Everytime we select an element and is compared with all the other elements in array and finally its…

Q: ) Insertion sort is chosen to sort this array, write the contents of the array each time that the…

A: As per Bartleby I am allowed to solve only 1 Question. As array is not mentioned I am taking…

Q: Q. An Array's name is Alpha[n], it has n number of inputs. The starting index of Alpha is 'strt',…

A: Algorithm: MergeSort(Alpha[], strt,  fnsh) If fnsh > l Find the middle point to divide the array…

Q: Could you help me solving this question please? The question is: Use insertion,bubble and…

A: Please give positive ratings for my efforts. Thanks.   PROGRAM   #include <stdio.h>  void…

Q: Numerical Value+Explanation

A: The arrray is sorted and we have 10000 elements. The maximum number of operations needed by binary…

Q: Given the following array: {30, 60, 20, 50, 40, 10, 5, 2, 8}. Use the following sort algorithms to…

A: First pass: {30, 60, 20, 50, 40, 10, 5, 2, 8} = {30, 60, 20, 50, 40, 10, 5, 2, 8} {30, 60, 20, 50,…

Q: 4. Consider the Quick-sort algorithm, which partitions elements into two sub-arrays, each of which…

A: Given each time one fifth is one subarray and rest i.e. 4/5th ( 1 - 1/5 = 4/5 ) is second array and…

Q: 4. Sort Matrix By Row Using Selection Sort, write a function sort_matrix_by_row that takes a matrix…

A: Program MAX_SIZE = 10  def sortByRow(mat, n):     for i in range (n):                   # sorting…

Q: Q1: Use Compiler of any programming language to create array A= [n], Generate A randomly as follows,…

A: n Insertion sort Selection sort bubble sort Merge sort Quick sort 100 7.4e^-5 sec 1.2e^-4 sec…

Q: Let A = [5,20,55,45,30,24,8,16,32,25] . Apply  Bubble Sort algorithm for the array A. Write the…

A: First pass: [5,20,55,45,30,24,8,16,32,25] -> [5,20,55,45,30,24,8,16,32,25] //No change coz 5 <…

Q: Sort the following array using insertion sort method, show the procedure set by set.…

A: In Insertion Sort, each element is picked and compared with its previous elements and inserted at…

Q: Use insertion Sort algorithm to sort the following array. Show all the intermediate steps to solve…

A: First of all let see how insertion sort works: In the insertion sort the given array is assumed as…

Q: 3. Use insert sort and the bubble sort to sort the following lists from smallest to largest: 1, 7,…

A: Answer :

Q: 1.) Suppose that you sort a large array of integers by using a merge sort. Next you use a binary…

A: We can say Binary search more efficient work fast than Merge sort. Let's know in details: Merge sort…

Q: Given an array A [10, 13, 20, 25, 32] that will be sorted into descending order. Use Insertion Sort…

A: Actually, array is an collection of elements.

Q: The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort…

A: Since the input array is not sorted , selection sort takes 4(n-1) iterations and bubble sort take 5…

Q: Use the merge sort algorithm to sort the following array. Sketch out the stages of the algorithm,…

A: The merge sort is about dividing an array and then merge by sorting. This is a divide and conquers…

Q: T/F: Binary Search can correctly determine whether an element is in an array if it is unsorted.

A: Answer is given below .

Q: Complete the swap algorithm to swap the first two values in an array. Assume the array is an array…

A: Here the concept of swapping is we are storing the element at index 0 in temp for future reference…

Q: 5.Given an array where numbers are in range from 1 to n6, which sorting algorithm can be used to…

A: Answer: The right choice is option A. Not possible to sort in line time. As redix sort depends upon…

Q: Use the following sorted array to answer the following questions: 1 3 4 6 7 8 10 11 1 2 5 7 11 13 17…

A: Binary Search is a searching technique on sorted arrays where we compare with mid element and if the…

Q: Binary search requires that the data be sorted before it can be applied. If we start with unsorted…

A: Binary search requires array to be sorted before searching an element in the array. By the using…

Q: Let the array A=(50,40,30,20,10} and we wan to sort it in ascending way using insertion sort then…

A: Actually, array is a collection of elements.

Q: Take a list of 7 unsorted numbers and apply Insertion Sort Technique to sort the

A: Actually, sorted is a arrange the elements in order.

Q: Question # 02: Let's assume we want to find the largest number in a non-empty array A. A sample…

A: We have an function in python that returns the maximum number of the non empty array A. We need to…

Q: Determine whether Counting Sort or Merge Sort sorts this array faster.

A: comparison and conclusion to which algorithm will be faster is provided in step 2.

Q: 2- Count the number of comparisons during merging the following two sorted arrays: 15 21 24 B 21 21…

A: Answer to the above question is in step2.

Q: 1. (a). Illustrate how Bubble sort will sort the following elements of the array a[6] in ascending…

A: <30,80,20,45,65,50>-given array Bubble sort compares first two elements if first…

Q: Consider the array given below. Provide all steps to show how selection sort would sort the array.…

A: According to the Question below the Solution:   Program Output:

Q: Following array is being sorted by Radix sort. Two iterations are already completed, What will be…

A: Actually, Array is a collection of elements.

Q: Question # 02:  Let’s assume we want to find the largest number in a non-empty array A. A sample…

A: As per our guidelines we are supposed to answer only one question. Kindly repost the remaining…

Q: Below is how the arrays are represented ARRAY1[] = [1, 5, 6, 6, 9, 9, 9, 11, 11, 21] Here length…

A: Solution Source code of the java "main.java" public class Main {        public static void…