Blog posts
 Apr, 2019

Apr 27, 2019
Merge Sort  A divide and conquer based sorting algorithm that works by dividing the input in two halves in each iteration and then eventually merging those in sorted order.

Apr 21, 2019
Insertion Sort  InsertionSort algorithm that sorts the given input dataset, one element at a time.

Apr 20, 2019
Selection Sort  SelectionSort algorithm to sort input dataset by finding minimum element in each iteration and posting it on its correct position.

Apr 17, 2019
Bubble Sort  BubbleSort algorithm for sorting input data by swapping adjacent elements (if required)

Apr 14, 2019
Interpolation Search  Interpolation Search, used for sorted data also works on the idea of checking fewer elements by discarding a portion of the input in every iteration.
 Feb, 2019

Feb 17, 2019
Jump Search  A searching algorithm for sorted input that performs better than linearsearch as it performs fewer comparisons.

Feb 15, 2019
Binary Search  Binary Search algorithm used for sorted datasets. This performs better than linear search for sorted input and completes in log(n) time as it works on the principle of working only half of the dataset in each iteration.

Feb 13, 2019
Linear Search  Linear Search also known as sequential search is a O(n) performing algorithm used primarily for its simplicity and bruteforce nature.

Feb 06, 2019
Algorithm Complexity  What, How, Why  Algorithm Complexity, BigO notatoin. WorstCase/AverageCase algorithm performance analysis.