Register

Mergesort

605 views
0 0 votes
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 2 recursive calls to merge sort

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Asymptotic NotationNext → · Storage Class
← Previous in category · Asymptotic NotationNext in category → · self doubt
Position:
Show:

Related questions

4 4 votes
4 4 answers
557
557 views
GO Classes asked Sep 26, 2025
557 views
GO Classes DPP | Algorithms|MERGESORT
If one uses a straight two-way merge sort algorithm to sort the following elements in ascending order:$$50,10,35,80,22,5,70,45,18,60,25,90$$then the order of these elemen...
2 2 votes
2 2 answers
289
289 views
GO Classes asked Aug 28, 2025
289 views
GO Classes DPP | Algorithms | Quicksort,Mergesort
Which of the following statements is/are not correct?(Here $o, \omega$ represents small-oh and small-omega, respectively.)The average-case time complexity of quicksort $=...
2 2 votes
3 3 answers
466
466 views
GO Classes asked Aug 26, 2025
466 views
GO Classes DPP | Algorithms | Mergesort
Consider the Merge Sort algorithm applied to an array of size $n$.Suppose every time we divide the array, instead of splitting it exactly in half, the left subarray alway...
2 2 votes
2 2 answers
353
353 views
GO Classes asked Aug 26, 2025
353 views
GO Classes DPP | Algorithms | Mergesort
If one uses a straight two-way merge sort algorithm to sort the following elements in ascending order:$$2,1,4,3,5,6,8,7,9,10,12,11,14,13,16,15$$The minimum number of pass...