In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order.
The most-used orders are numerical order and lexicographical order.
- Selection Sort
- Bubble Sort
Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order.
- Insertion Sort
- Quick Sort
- Merge Sort
- Heap Sort
- Radix Sort
- Topological Sort It is Used in Graphs. Go Back{: .btn}