As the name implies, it is the quickest sorting algorithm, which use divide and conquer strategy for sorting data. In quicksort, it divide the array of items to be sorted into two partitions and then call the quicksort procedure recursively to sort the two partitions, quicksort divide the problem into two smaller ones and conquer by solving the smaller ones.

Click here for Quicksort in Java

## Comments

## Post a Comment