Radix Sort is a non-comparative sorting algorithm. Unlike traditional sorting methods that compare elements directly like Merge Sort, Radix Sort processes individual digits of numbers, which allows it to efficiently sort lists of integers (and even strings of characters, with…
Insertion sort is a simple, intuitive sorting algorithm that builds the final sorted array (or list) one item at a time. Despite being less efficient on large lists compared to more advanced algorithms like QuickSort or MergeSort, its simplicity and…
Merge Sort is a divide-and-conquer sorting algorithm. It splits an array into halves, sorts each half, and then merges the sorted halves back together. Unlike simpler, more intuitive sorting methods such as Bubble Sort or Insertion Sort, Merge Sort excels…
Selection Sort is a comparison-based sorting algorithm that divides the input list into two parts: a sorted subset at the beginning of the list and an unsorted subset that occupies the remainder of the list. The algorithm repeatedly selects the…
Bubble sort is one of the simplest sorting algorithms that works by repeatedly swapping adjacent elements if they are in the wrong order. This process is repeated until the list is sorted. Despite its simplicity, bubble sort is not the…
Binary search is a fundamental algorithm in computer science, offering an efficient way to find an item in a sorted array. Unlike linear search, which scans each item in the array sequentially until the target is found, binary search divides…
Introduction Tree traversal algorithms allow us to systematically visit every node in a tree structure, serving as foundational techniques for a myriad of applications in computer science. These methods—pre-order, in-order, and post-order traversal—each have their unique way of navigating through…
Introduction Hash tables are a fundamental data structure used in computer science for fast data retrieval. They store key-value pairs and offer remarkable efficiency in searching for a value associated with a given key. We previously learned about linked lists.…
Introduction Depth-First Search or DFS in short, is a common graph traversal algorithm over graphs. Imagine that you are digging a hole in the ground. You could dig deep first and then widen the hole or do the opposite. Unlike…
Introduction Breadth-First Search or BFS in short, is one of the most commonly used traversal algorithms over graphs, also having many practical applications such as shortest path finding, web crawling and more. What is a graph traversal algorithm? Graph traversal…
