Create bogosort.py
Bogosort randomly sorts a list until it is sorted. Its computational complexity has a best case of O(n) and a worst case of O(n!).
N
Naveen Arunachalam committed
976e81f88d3b74a31db9f80757b0192306786c14
Parent: c55eb1d
Committed by GitHub <noreply@github.com>
on 8/4/2016, 6:07:45 PM