|
- Write a procedure for the merge procedure Merge1(a, i, j, k).
- Write non-recursive procedure for merge sort.
- Modify merge sort procedure to sort number in non-ascending order.
- For what input, merge sort takes maximum number of comparisons.
- Implement merge sort algorithm in c.
- Trace the Quick sort algorithm on sorted array of elements 1 to 10.
- Trace the Quick sort algorithm on elements 10, 9, 8, .... 1.
- Write a program for quick sort method.
- Implement the radix sort.
- Design an algorithm to sort given names using radix sort.
|
|