Medium Problems on Sorting
- Inversion count in Array using Merge Sort
- Find the Minimum length Unsorted Subarray, sorting which makes the complete array sorted
- Sort a nearly sorted (or K sorted) array
- Sort n numbers in range from 0 to n^2 – 1 in linear time
- Sort an array according to the order defined by another array
- Find the point where maximum intervals overlap
- Find a permutation that causes worst case of Merge Sort
- Sort Vector of Pairs in ascending order in C++
- Minimum swaps to make two arrays identical
- Chocolate Distribution Problem
- Permute two arrays such that sum of every pair is greater or equal to K
- Bucket Sort To Sort an Array with Negative Numbers
- Sort a Matrix in all way increasing order
- Convert an Array to reduced form using Vector of pairs
- Smallest Difference Triplet from Three arrays
- Check if it is possible to sort an array with conditional swapping of adjacent allowed
Sorting Algorithms
A Sorting Algorithm is used to rearrange a given array or list of elements according to a comparison operator on the elements. The comparison operator is used to decide the new order of elements in the respective data structure.
For Example: The below list of characters is sorted in increasing order of their ASCII values. That is, the character with a lesser ASCII value will be placed first than the character with a higher ASCII value.
Table of Content
- What is Sorting?
- Sorting Terminology
- Characteristics of Sorting Algorithms
- Applications of Sorting Algorithms
- Basics of Sorting Algorithms
- Sorting Algorithms
- Library Implementations
- Easy Problems on Sorting
- Medium Problems on Sorting
- Hard Problems on Sorting
Contact Us