Reading Time: 3 minutes Description Heap is a tree-based data structure with some special attributes embedded into it.  Heap Data Structure has such characteristics; It is a form of Complete Binary Tree, It has a root node and its key is compared to the children nodes and the comparison is constantly carried out whenever a new node is aimed

Radix Sort

Reading Time: 2 minutes Definition The optimal algorithm for the numbers range from 1 to n2. Radix Sort algorithm favors of Counting Sort internally to sort the array. The given keys consists of the digits in each element in the array.It starts from the Least Significant Digit which is the left digit, then goes to the Most Significant Digit which

Merge Sort

Reading Time: 2 minutes Definition Merge sort yet another sorting algorithm that benefits from the divide-and-conquer principle.  The main goal in this algorithm is to split the given array into individuals and merge them back during the course of the comparison. Merge Sort seems kind of similar to the Merge sort, in the Comparison below you can study the

Quick Sort

Reading Time: 1 minute Definition Quick sort is a very efficient algorithm that leverages the divide-and-conquer principle to sort a data structure. The calculated performance complexity of Quick Sort  as follows; Best Case: O(n log n), Average Case: O(n log n), Worse Case: O(n2), reason: the algorithm will select only one element in each iteration Space Complexity: O(log n). Terminology

Bubble Sort

Reading Time: 1 minute Description Bubble sort will repeatedly compare and swap adjacent items. If the item on the left is greater, it swaps it with the right item. Basically the greater items are shifted towards the right direction. Furthermore, the second iteration is stopped because the last items are sorted already we wont go though them again. Furthermore,