- Sorting Algorithms - GeeksforGeeks
There exist different sorting algorithms for different different types of inputs, for example a binary array, a character array, an array with a large range of values or an array with many duplicates or a small vs large array The algorithms may also differ according to output requirements
- Sorting (Bubble, Selection, Insertion, Merge, Quick, Counting, Radix . . .
Sorting is a very classic problem of reordering items (that can be compared, e g , integers, floating-point numbers, strings, etc) of an array (or a list) in a certain order (increasing, non-decreasing (increasing or flat), decreasing, non-increasing (decreasing or flat), lexicographical, etc) There are many different sorting algorithms, each
|