Monday, 19 September 2011

C Algorithms - Quick Sort

Quick Sort
Quick sort is a comparison sort developed by Tony Hoare. Also like merge sort it is a divide and conquer algorithm and just like merge sort it uses recursion to sort the lists. It uses a pivot chosen by............
 C Algorithms - Quick Sort


Post a Comment

Free Host | lasik surgery new york