{"push_id":610453121,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"c264de640ad26539080e196d62e5cb189124d8c0","before":"b9773f68db2a1563f3656868a325d8aba7eba579","commits":[{"sha":"c264de640ad26539080e196d62e5cb189124d8c0","author":{"email":"93707d0f11ac5594781be8597c7e0f269a49aaed@gmail.com","name":"Tsvetan T Koshutanski"},"message":"merge sort algorithm and count inversions( first programming question in the lectures)","distinct":true,"url":"https://api.github.com/repos/ceckobecko/algorithms/commits/c264de640ad26539080e196d62e5cb189124d8c0"}]}