{"push_id":1292027913,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"9d6901548c48d624c133b7f852c0bec6820a1ad7","before":"0057cf8dd6bcbe7eebc542b3f5bc9faee5b8397d","commits":[{"sha":"9d6901548c48d624c133b7f852c0bec6820a1ad7","author":{"name":"ISHAN SHARMA","email":"03d2a0f49c29b6faadbe3b4f643f1e8f7a467214@gmail.com"},"message":"Add files via upload\n\nThis program uses find median method to find a good pivot to reduce the time complexity of partition method. it also finds the rank in order n time.","distinct":true,"url":"https://api.github.com/repos/MrIshanSharma/Algorithms-and-Data-Structure/commits/9d6901548c48d624c133b7f852c0bec6820a1ad7"}]}
{"actor":{"display_login":"MrIshanSharma"}}