Project8 (Analyzing the efficiencies of Quick sort and Merge sort using Divide and Conquer approach) Take an integer array from user; then apply Merge sort and Quick sort on it. Show all the steps in both sorting techniques and show total number of key comparisons for each sorting approach; and proves which one is better sorting approach by analyzing minimal key comparisons.
dalalsunil1986 / quickmergesort Goto Github PK
View Code? Open in Web Editor NEWThis project forked from daniyalahmedkhan/quickmergesort