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 yet another 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 themselves as also the name

Queue

Reading Time: 2 minutes Definition Queue is a linear data structure the iteration starts at one point and carries on to the end point. It maintains FIFO First In First Out in sequence and has two varieties of implementations; we can prefer to implement in array or singly linked list. To elaborate FIFO with an example; a queue of

Stack

Reading Time: 2 minutes Definition Stack is a very usable data structure. It is not as widely as used in our daily coding tasks, because of its nature of LIFO. Let’s elaborate LIFO; LIFO is the abbreviation of Last-In-First-Out. What can it really mean for us? Well there is only one specific reason why you would want to use

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

Big O Notation

Reading Time: 4 minutes Definition The big o notation is simplified analysis of an algorithm’s efficiency. It is also known as Landau’s Symbol. Big O Notation is used in Computer Science and Mathematics to describe the Asymptotic behavior of functions. Let’s study some of Big O Notation characteristics; Big O Notation enlightens about the complexity of a target algorithm