This algorithm sorts an array by repeatedly finding the minimum element from the unsorted part and putting it at the beginning. There are two parts to this algorithm (and thus two loops): 
1. The subarray that is already sorted
2. The remaining subarray that is unsorted. 

For instance, if we had an array ```arr[] = 64 25 12 22 11```

The algorithm will sort the array in the following steps:
```
11 25 12 22 64

11 12 25 22 64

11 12 22 25 64

11 12 22 25 64
```

Logic behind Selection Sort

https://www.geeksforgeeks.org/selection-sort/

University of Minnesota - Twin Cities

- Bubble Sort
- Selection Sort
- Merge Sort
- Quick Sort
- Shell Sort
- Radix Sort
- Bitonic Sort
- Bucket Sort
- Quickselect
- Heap Sort

Sorting & Selection Algorithms

https://www.geeksforgeeks.org/bubble-sort/

Bubble Sort

https://www.geeksforgeeks.org/merge-sort/

Merge Sort

https://www.geeksforgeeks.org/quick-sort/

Quick Sort

Shell Sort

https://www.geeksforgeeks.org/radix-sort/

Radix Sort

https://www.geeksforgeeks.org/bitonic-sort/

Bitonic Sort

https://www.geeksforgeeks.org/bucket-sort-2/

Bucket Sort

A heap is a tree in which items are sorted in a special way. There are two types of heaps: a min-heap and a max heap. A min-heap is one where the parent value is less than the value of the children. A max heap is one where the parent value is greater than the value of the children.

A heap sort algorithm for sorting in increasing order is as follows:
1) Build a max heap from input data
2) Replace the largest item (root) with the last item of the heap and reduce the size of the heap by 1. Then heapify the root of the tree.
3) Repeat step 2 while the size of the heap is greater than 1.

Learn Before

Related

Learn After