R basically supports two different types of sorting.
The first is comparison-based sorting, wherein all the key values of the input vector are directly compared with each other prior to ordering.
The second type is non-comparison-based sorting, wherein computations are performed on each key value, and then the ordering is performed based on the computed values
Three Θ(n2) sorting algorithms:-
- Shell sort
- Merge sort
- Bin sort and radix sort