Search for a command to run...
Series
This series cover explanation, my learnings and resources about Data Structures and Algorithms
Among the various search algorithms, Linear Search stands out as the most fundamental. In this article, we will delve into the workings of Linear Search and break down its implementation step by step. What is Linear Search? Linear Search is a simple ...
Binary search is a cornerstone of efficient searching techniques, particularly when dealing with large datasets. Its power lies in its ability to drastically cut down the number of comparisons needed to locate an element, thanks to its divide-and-con...
Bubble sort (also called as Sinking Sort and Exchange Sort) is a straightforward sorting algorithm that operates by repeatedly comparing and swapping adjacent elements if they are in the wrong order. What is Bubble Sort? Bubble Sort is a comparison s...
Selection Sort is a simple sorting algorithm that repeatedly finds the smallest (or the largest) element from the unsorted part and moves it to its correct position. What is Selection Sort? Selection sort is a comparison sort algorithm. It repeatedly...
Insertion sort is a simple comparison-based sorting algorithm that sorts by repeatedly inserting elements into their correct position. Let's explore how it works in detail. What is Insertion Sort? Insertion Sort is a comparison sort algorithm. It div...
Cyclic sort is an in-place and unstable sorting algorithm that is specifically designed to efficiently sort arrays where numbers are in a known range like from 1 to N. How does it work? Let’s take the following array as an example. We need to sort it...
