DS-(I) Assignment 3: Sorting Algorithms –Counting Sort, Merge Sort, Quick Sort

 

Set A.

a) Sort a random array of n integers (accept the value of n from user) in ascending order by using recursive Counting sort algorithm.

 

b)Sort a random array of n integers (accept the value of n from user) in ascending order by using a recursive Merge sort algorithm.

 

c) Sort a random array of n integers (create a random array of n integers) in ascending order by using recursive Quick sort algorithm.