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

Posted on Apr 20, 2020

30 Days of Algorithms – Day 2: Insertion sort

Posted in 30 days of algorithms, Sorting Algorithms

Insertion sort is a simple sorting algorithm. Though it may not be much efficient for a larger input size, it has some advantages. Like it has a simple implementation. Jon Bentley showed a three-line version in C programming language. It is also more efficient the bubble sort or selection sort. It is an adaptive...

Posted on Apr 19, 2020

30 Days of Algorithms – Day 1: Bubble sort

Posted in 30 days of algorithms, Sorting Algorithms

It is named bubble sort for the way that the smaller or larger elements bubble up to the top. Sometimes it is also known as sinking sort for the opposite reason. It is a comparison sort that repeatedly iterates through the list, compares the adjacent elements and swaps them if they are in the...

Scroll to top
Copy link