Easy Problems on Sorting
- Sort elements by frequency
- Sort an array of 0s, 1s and 2s
- Sort numbers stored on different machines
- Sort an array in wave form
- Check if any two intervals overlap among a given set of intervals
- How to sort an array of dates in C/C++?
- Sorting Strings using Bubble Sort
- Find missing elements of a range
- Sort an array according to count of set bits
- Sort even-placed elements in increasing and odd-placed in decreasing order
- Sort an array when two halves are sorted
- Sorting Big Integers
- Sort a linked list of 0s, 1s and 2s
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