Posted on Apr 22, 2020

30 Days of Algorithms – Day 4: Quicksort

Posted in 30 days of algorithms, Divide and Conquer, Sorting Algorithms

As the name refers, the quicksort is quick! If implemented well, it can perform two to three times faster than merge sort and heap sort. It is an efficient sorting algorithm developed by Tony Hoare in 1959 and published in 1961. It is a comparison sorting algorithm that acquires the Divide and Conquer approach....

Scroll to top