Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
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 Linear Search and Binary Search EASY
In this blog, we will discuss linear and binary search with its implementation. We will also discuss its properties and the differences between them.
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.
Bubble Sort C++ EASY
In this blog, we will discuss bubble sort C++. We will look at the various implementation ways along with their time and space complexities.
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.
Radix Sort
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.
Quick Sort Program 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.
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.
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.
Understanding Heap Sort
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.
What is 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.
Java Program for QuickSort
This article will discuss Quicksort and see its intuition, algorithm, and implementation in Java.
Quick Sort Algorithm MEDIUM
Quick Sort is an element chosen as the pivot, and it is used to sort the elements of an array in ascending or descending order.
6 Sorting Algorithms, Features and Functions
In this article, we will cover 6 Sorting Algorithms, Features & Functions.
Insertion Sort Algorithm EASY
In this blog, we will learn about Insertion Sort in programming languages.
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.
Topological Sorting MEDIUM
This article discusses all aspects of topological sorting. It includes its algo, implementation, advantages, disadvantages and applications.