{"push_id":1479185443,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"c194ec4f666e811392aaee7a374b43be681006a0","before":"47f3093f80fba66131e67ea016d7889fd1cab6d0","commits":[{"sha":"c194ec4f666e811392aaee7a374b43be681006a0","author":{"name":"Veeraj S Khokale","email":"ca4f9b3085149187db42e544d8a604c07a31b85c@gmail.com"},"message":"Intro sort added\n\nAdded intro sort which uses quick sort, but switches\nto heap sort if depth of quicksort goes beyond twice\nthe logrithmic size of the input","distinct":true,"url":"https://api.github.com/repos/veerajskhokale/libadcpp/commits/c194ec4f666e811392aaee7a374b43be681006a0"}]}
{"actor":{"display_login":"veerajskhokale"}}