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

Linked List

Reading Time: 3 minutes Definition Linked List a linear data structure like Arrays, but its internal is completely different compared to other data structures. Let’s first have a visual look how the data structure looks like As you can see in the above image Linked List maintains a list of objects linked to them, as also the name suggests


Reading Time: 2 minutes Definition Queue is a linear data structure that maintains FIFO setting; First In First Out. Queue comes in two possible internal implementations; Singly Linked List or Array. When think of FIFO, we can assume a group of people waiting queued up for buying a cinema ticket. The first person in the queue gets to buy


Reading Time: 2 minutes Definition Stack is a very usable data structure that brings the LIFO setting into the game. Let’s elaborate LIFO; LIFO is the abbreviation of Last-In-First-Out. What does LIFO really mean for us? The intentions may vary and one of them is to have a pile of things stacked down to the bottom and take one

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