{"push_id":684531738,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"1f206f9fec961dac64d270501bb0864f399e662a","before":"7ba660becacfd0170cbf23801e5e81e11dbce6cb","commits":[{"sha":"1f206f9fec961dac64d270501bb0864f399e662a","author":{"email":"730f4b1719fa8b961be452196af08b13fcf3a941@gmail.com","name":"Patrick McCuller"},"message":"Burst-sort alpha\n\nPreliminary implementation of burst sorter. Running faster than\narray.sort() on all English words in Shakespeare. Work left to do!","distinct":true,"url":"https://api.github.com/repos/pmcculler/datastructures/commits/1f206f9fec961dac64d270501bb0864f399e662a"}]}