{"push_id":1120426846,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"2e11c00cec1b3a829e856c78c3e71d31897c5887","before":"3dab416d6912843d163d4cf259e97937b5aab64b","commits":[{"sha":"2e11c00cec1b3a829e856c78c3e71d31897c5887","author":{"email":"a4fa2a45d9de42ee432a29cb7194239cb54a829e@gmail.com","name":"Pei Zhao"},"message":"Recursion - Divide and Conquer - Median of Two Sorted Array (C++)","distinct":true,"url":"https://api.github.com/repos/ShadowGiraffe/algorithms/commits/2e11c00cec1b3a829e856c78c3e71d31897c5887"}]}
{"actor":{"display_login":"ShadowGiraffe"}}