{"push_id":2615262937,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"86c7c37f376a06a1b79a3282a6419c2701a9b08f","before":"6a46dd186a7922e0ebd3443afec1fc237439f010","commits":[{"sha":"86c7c37f376a06a1b79a3282a6419c2701a9b08f","author":{"name":"Chris Lamb","email":"37b5b08843cd92545e0626dbbdd290e0095ef20f@gmail.com"},"message":"Add divide and conquer solutions to inversion counting problems","distinct":true,"url":"https://api.github.com/repos/Chris-Lamb/algorithms/commits/86c7c37f376a06a1b79a3282a6419c2701a9b08f"}]}
{"actor":{"display_login":"Chris-Lamb"}}