{"push_id":929190246,"size":1,"distinct_size":1,"ref":"refs/heads/patch-1","head":"f21498033b9300bb4445c9ad6c202c7d9e22affe","before":"3a991228fe1fa05e7a9c2260a696ca7ce3b38317","commits":[{"sha":"f21498033b9300bb4445c9ad6c202c7d9e22affe","author":{"email":"edf925cb290ae153cf3785bdf8dcb144eb3303ce@iitj.ac.in","name":"tastelessWine"},"message":"quicksort\n\nquicksort is basic sorting algorithm whose averagetime of running is n*log(n);","distinct":true,"url":"https://api.github.com/repos/tastelessWine/Algorithms/commits/f21498033b9300bb4445c9ad6c202c7d9e22affe"}]}