A script to experimentally visualise the amount of comparisons needed to sort an integer array of varying lengths with the bogo sort algorithm. The bogo sort algorithm randomly permutates an array until it is sorted and is an extremely inefficient algorithm.
Run each of the cells in bogo.ipynb
Created by Nasser Kessas
PRs accepted, feel free to dive in! Open an issue or submit PRs.
Bogo sort follows the Contributor Covenant Code of Conduct.