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....

Posted on Apr 21, 2020

30 Days of Algorithms – Day 3: Merge Sort

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

Merge sort is an efficient and general-purpose sorting algorithm. It is a Divide and Conquer algorithm that was introduced by John von Neumann in 1945. It is one of the most used sorting algorithms. Many programming languages like Java, Perl use this algorithm in the built-in sorting function. This is the third day of...

Scroll to top