This repo includes sorting algorithms such as:
- Bogo sort
- Selection sort
- Bubble sort
Bogo sort is basically reshuffling the list until it's sorted. It's not an efficient algorithm to use (O((n+1)!)).
Finding the current minimum number of the list, adding it to the first index of unsorted list, and keep doing it until it's completely sorted. It can be done either swapping indexes or creating a new list. In selection.py, you can see an example of new list creating method
image source
This algorithm compares two adjacent elements and swaps them until they are in the intended order. In bubble.py, you can see an example of a sorting algorithm starting from the end of the list and keep towards the beginning.
image source