{"push_id":834039134,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"04266bbaaa8e7bbce00b11fa8a74c4ab75a660f1","before":"b0740390b91c2ff58a47055d49958ab3101a5205","commits":[{"sha":"04266bbaaa8e7bbce00b11fa8a74c4ab75a660f1","author":{"email":"d7eed46a44301333b029a040da1b33713db34300@gmail.com","name":"Alessandro Giambruno"},"message":"Merge sort: inversions of a big array\n\nDivide and conquer approach to solve the inversions of a big array","distinct":true,"url":"https://api.github.com/repos/gidantribal/algorithms/commits/04266bbaaa8e7bbce00b11fa8a74c4ab75a660f1"}]}