Sorting Algorithms - Advanced
A sorting algorithm is used to arrange a given set of data into a specific order based on the comparison. Based on the comparisons, a new order of the elements is decided. There are plenty of sorting algorithms like merge sort, quick sort, and bubble sort, etc. Sorting is essential for optimizing the performance of other algorithms that require sorted input data. This category brings to you the various types of Sorting Algorithms along with their complexity analysis. Not only this, you can find common interview questions and diverse techniques for solving these problems.
Smallest Index with Equal Value
By Husen Kagdi
● Published At Dec 2021
In this blog, we will discuss a Leetcode Easy problem, smallest index with equal value. This problem has been asked in the latest weekly contest organized by Leetcode. ... Keep reading ..
Divide and Conquer
Divide and Conquer is an algorithm paradigm that is based on Recursion. A problem is broken down into a set of smaller subproblems repeatedly until no more division is possible. The atomic subproblems are similar to the original problem and are solved recursively. The solution of the subproblems are merged together to obtain the solution of the original problem. Multiple recursive calls are involved in solving a problem using the divide and conquer algorithm.
Merge Sort
Merge sort is essentially a divide and conquer algorithm. We divide the input array into two subarrays and continue dividing the subarrays recursively
Quick Sort
Quicksort is a divide and conquer algorithm, which sorts an array using a pivot. We divide the array around this pivot such that the subarray on the l
puzzle icon

Top Problems related to Sorting Algorithms - Advanced