Question

1) Sort 3, 4, 5, 6, 1, 9, 2, 5, 6 using insertion sort. 2) Sort 3, 4, 5, 6, 1, 9, 2, 5, 6 using merge sort. 3) Sort 3, 4, 5, 6, 1, 9, 2, 5, 6, 5, 3 using quick sort with median of three pivot, with insertion sort cutoff at 4. 4) Sort 34, 37, 83, 51, 84, 22, 43 using radix sort with radix=10.

          1) Sort 3, 4, 5, 6, 1, 9, 2, 5, 6 using insertion sort.
2) Sort 3, 4, 5, 6, 1, 9, 2, 5, 6 using merge sort.
3) Sort 3, 4, 5, 6, 1, 9, 2, 5, 6, 5, 3 using quick sort with
median of three pivot, with insertion sort cutoff at 4.
4) Sort 34, 37, 83, 51, 84, 22, 43 using radix sort with
radix=10.

1) Sort 3, 4, 5, 6, 1, 9, 2, 5, 6 using insertion sort.
2) Sort 3, 4, 5, 6, 1, 9, 2, 5, 6 using merge sort.
3) Sort 3, 4, 5, 6, 1, 9, 2, 5, 6, 5, 3 using quick sort with
median of three pivot, with insertion sort cutoff at 4.
4) Sort 34, 37, 83, 51, 84, 22, 43 using radix sort with
radix=10.

Added by Karen A.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Aishwarya Krishnakumar

Step 1

- Compare it with the previous element, which is empty in this case. - Since there is no previous element, we move on to the next element. - The next element is 4, which is greater than 3, so we leave it in its place. - Move on to the next element, which is 5. - Show more…

Show all steps

Thanks for your feedback!

1) Sort 3, 4, 5, 6, 1, 9, 2, 5, 6 using insertion sort. 2) Sort 3, 4, 5, 6, 1, 9, 2, 5, 6 using merge sort. 3) Sort 3, 4, 5, 6, 1, 9, 2, 5, 6, 5, 3 using quick sort with median of three pivot, with insertion sort cutoff at 4. 4) Sort 34, 37, 83, 51, 84, 22, 43 using radix sort with radix=10.