Last updated: Aug 7, 2022

Searching and Sorting Algorithms

Searching and Sorting Algorithms are one of the most important topics that a programmer covers in his journey, Searching algorithms are used to retrieve elements from any data structure, and Sorting algorithms are used to rearrange and reorganize elements in a data structure as per specified order. Various algorithms are covered in this section and have different uses as the need arises, this section will teach you the best searching and sorting algorithms and how they'll be used as the need arises.
Binary Search Algorithm EASY
In this article, we will explore the Binary Search Algorithm. We will also discuss the recursive and iterative ways to implement the binary search algorithm, its applications etc.
Interpolation Search MEDIUM
This article will teach us about Interpolation Search. We will learn their internal working, algorithms, complexities, implementation and applications.
Difference Between Searching and Sorting EASY
This article covers the concepts of Searching and Sorting along with some frequently asked questions
Binary Search Vs Ternary Search EASY
In this article, we’ll learn the difference between binary search and ternary search in terms of their time complexities.
Breadth First Search In Python MEDIUM
In this article, we'll learn about the BFS algorithm, understand how it works, implement it in Python, analyze its complexity, and discuss its applications.
Recursive Binary Search EASY
In this blog, we will look into Recursive Binary Search in three languages(C, Java, and Python) with their time and space complexity.
Binary Search in C++ EASY
Explore binary search in C++ with clear examples. Learn how it works and get code implementations for both recursive and iterative approaches of binary search program in C++.
Linear Search in C++ EASY
Linear Search is a simple searching algorithm used in C++ (and other programming languages) to find a specific element in a list or array.
Heap Sort Program in C MEDIUM
Heap Sort Program in C is a comparison-based sorting technique based on a binary heap data structure. It's similar to selection sort where we first find the maximum element and place the maximum element at the end.
Radix Sort in C EASY
In this article, we will learn what radix sort is, how it works with examples, and its time & space complexity. We will also see how to code radix sort in the C programming language from scratch.
Sorting Array in C EASY
In this article, we will discuss the concept of sorting an array in C and especially focus on two popular sorting algorithms: selection sort and bubble sort. 
Radix Sort EASY
This article will illustrate the Radix Sort technique while explaining its uses, working, the algorithm, code and the time and space complexity for the algorithm.
Selection Sort in Python EASY
This article will help you understand how selection sort works, with it’s implementation in Python. We will also discuss it’s time complexity to see it’s efficiency.
Quick Sort in C MEDIUM
In this blog, we will learn about Quick Sort Program in C. We will understand its core concepts, its usage, and much more for better understanding.
Selection Sort In Java EASY
In this blog, we will learn about Selection sorting in Java. We will understand its time complexity, space complexity and much more for better understanding.
Selection Sort in C EASY
In this article, we will discuss the algorithm, implementation, & analysis of selection sort in C programming language. We will cover the step-by-step process, with code examples, & discuss the advantages & disadvantages and various applications also.
Quick Sort vs Merge Sort EASY
In this article, we will discuss the concepts of quick sort & merge sort, understand their algorithms, provide step-by-step explanations, & compare their characteristics.
Merge Sort in Java EASY
In this article, we will discuss the workings of merge sort, illustrate its steps, implement it in Java, analyze its complexity, and discuss its applications, advantages, and disadvantages.
Selection Sort in C++ EASY
In this article, we'll explain how selection sort functions, with every possible step and how to code it in C++ with its space and time complexity.
Bubble Sort in Python MEDIUM
Despite its simplicity, Bubble Sort is not very efficient for large datasets, but it is a great algorithm for beginners to learn and understand the basics of sorting.
Merge Sort in C++ MEDIUM
Merge sort is a popular sorting algorithm that follows the divide-and-conquer approach. It divides the input array into smaller subarrays, sorts them recursively, & then merges the sorted subarrays to produce the final sorted array.
Quick Sort in C++ EASY
QuickSort sorts elements by selecting a 'pivot' element from the array and partitioning the other elements into two categories: those less than the pivot and those greater than it. This process is called partitioning. After partitioning, QuickSort recursively applies the same logic to the smaller sub-arrays.
Bucket Sort MEDIUM
This article will illustrate the Bucket Sort technique and explain its working with the help of a code snippet and algorithm for the chosen example.
Merge Sort in C EASY
In this article, we will discuss the concept of merge sort, understand its working principle, implement it using the C programming language, analyze its time & space complexity, and its advantages and disadvantages.
Bubble Sort Algorithm EASY
Bubble sort is a sorting algorithm that compares the adjacent elements repeatedly and swaps them if they are out of order until the entire array is sorted.
Insertion Sort in Java EASY
In this article, we will discuss the principle of the insertion sort algorithm, its implementation and analyze its time and space complexities.
Heap Sort in Data Structure MEDIUM
This blog covers the working and implementation of heap sort in C++, a discussion around its time and space complexity, and the advantages of heap sort.
Counting Sort EASY
In this blog, we will discuss the counting sort algorithm implementation, its examples, complexities, and procedures.
Binary Insertion Sort EASY
This article will discuss the binary insertion sort along with the application example, algorithm, and implementation of the binary insertion sort.
What is Selection Sort? MEDIUM
Learn about Selection Sort in C, C++, Java, Python, C#, its working, implementation, and the selection sort time complexity and space complexity in different languages.
Java Program for QuickSort EASY
QuickSort in Java is an efficient sorting algorithm using a pivot, recursively dividing and sorting arrays, implemented with partitioning and recursion.
Sorting Algorithms MEDIUM
In this article, we will cover 6 Sorting Algorithms, Features & Functions.
Insertion Sort Algorithm EASY
Insertion Sort is a simple and intuitive sorting algorithm that builds the sorted array one element at a time. It is efficient for small data sets or nearly sorted data.
Searching and Sorting in Rotated Sorted Array | Part-1
This blog discusses the solution of a problem in which we have to search a given element in a rotated sorted array of distinct elements.