{"push_id":614916002,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"38e6cbab21e9d9721aa23d87c43700251b3c42b6","before":"15ae28fb12f2b0194853c893b5327955c53ea99e","commits":[{"sha":"38e6cbab21e9d9721aa23d87c43700251b3c42b6","author":{"email":"2ec1ddb5b29133e23d1e8722efead92bce315ef7@aurametrix.com","name":"Aurametrix"},"message":"bogosort\n\nsimply shuffles a collection randomly until it is sorted.\r\nperversely inefficient algorithm only used as an in-joke. Its average run-time is O(n!)","distinct":true,"url":"https://api.github.com/repos/Aurametrix/Alg-H/commits/38e6cbab21e9d9721aa23d87c43700251b3c42b6"}]}