If one uses a straight two-way merge sort algorithm to sort the following elements in ascending order: 20, 47, 15, 8, 9, 4, 40, 30,12, 17Then the order of these elements after the second pass of the algorithm is ________.*1 point8, 9, 15, 20, 47, 4, 12, 7, 30, 408, 15, 20, 47, 4, 9, 30, 40, 12, 1715, 20, 47, 4, 8, 9, 12, 30, 40, 174, 8, 9, 15, 20, 47, 12, 17, 30, 40

The ___________________ algorithm sorts values by repeatedly comparing neighboring elements in the list and swapping their position if they are not in order relative to each other. A. quick sort B. bubble sort C. insertion sort D. merge sort E. selection sort

Given the following list of numbers: [21, 1, 26, 45, 29, 28, 2, 9, 16, 49, 39, 27, 43, 34, 46, 40] which answer illustrates the list to be sorted after 3 recursive calls to mergesort? Select one: a. [21,1] b. [16, 49, 39, 27, 43, 34, 46, 40] c. [21] d. [21, 1, 26, 45]

Consider the following array: array = [38, 27, 43, 3, 9, 82, 10].Using merge sort – the first round of the merge sort algorithm will be [38]  [27]  [43]  [3]  [9]  [82]  [10].What will the second round of the merge sort algorithm be:a.[27, 38], [3, 43], [9, 82], [10]b.[38, 27], [43, 3], [82, 9], [10]c.[38,27,43],[3,9,82] , [10]d.[3,27,38], [9,43,82,10]

Which sorting algorithm compares adjacent elements and swaps them if they are in the wrong order?Options: Pick one correct answer from belowBubble SortSelection SortInsertion SortMerge Sort

Which of the following is a stable sorting algorithm?Merge sort Typical in-place quick sortHeap sortSelection sort