{"push_id":1444520807,"size":4,"distinct_size":4,"ref":"refs/heads/master","head":"2dce9ca498705b2e374b8a49bc091779eea15981","before":"32c57b495d62dac92b36e285830ce1486dc46b6e","commits":[{"sha":"dbf86a4fdc6aed8d7dce1014296adbc052658ac5","author":{"name":"adaco","email":"d592261e0a7b6c84034bfab85122b375ee58a2f2@uchicago.edu"},"message":"A shell script that downloads the problem set file.\n\nThis shell script curls the array of 10,000 items contained uploaded\nto cloudfront by the instructor. This is the actual problem set,\nnot a test case.","distinct":true,"url":"https://api.github.com/repos/adaco/algorithmscoursera/commits/dbf86a4fdc6aed8d7dce1014296adbc052658ac5"},{"sha":"60b5df8ed403aff615d9292b8f562150be7714fc","author":{"name":"adaco","email":"d592261e0a7b6c84034bfab85122b375ee58a2f2@uchicago.edu"},"message":"Array of 10,000 elements for the problem set.","distinct":true,"url":"https://api.github.com/repos/adaco/algorithmscoursera/commits/60b5df8ed403aff615d9292b8f562150be7714fc"},{"sha":"c1174a99f474619cd76751441cc91270085fd561","author":{"name":"adaco","email":"d592261e0a7b6c84034bfab85122b375ee58a2f2@uchicago.edu"},"message":"Test case presented in the lecture.\n\nThis is the test case that's presented in the Week 3 lecture. I've\nincluded it for completeness so that I can verify that every\nstep of my partition algorithm works as expected.","distinct":true,"url":"https://api.github.com/repos/adaco/algorithmscoursera/commits/c1174a99f474619cd76751441cc91270085fd561"},{"sha":"2dce9ca498705b2e374b8a49bc091779eea15981","author":{"name":"adaco","email":"d592261e0a7b6c84034bfab85122b375ee58a2f2@uchicago.edu"},"message":"Finalization of the quicksort algorithm.\n\nThis commit finalizes the implementation of the quicksort algorithm,\nand contains (in the main function declaration) a logic switch\nthat allows us to test the algorithm on all of the test cases and\nthe problem set.\n\nI've implemented three alternative pivot choices, per the problem\nset assignment: first element, last element, and the element\ncontaining the median value in the first, last, and middle element.\n\nI've also corrected an issue in the partition algorithm that\ncaused the comparison to occur between *j and *i, rather than\nbetween *j and *begin. This led to incorrect partition results.","distinct":true,"url":"https://api.github.com/repos/adaco/algorithmscoursera/commits/2dce9ca498705b2e374b8a49bc091779eea15981"}]}
{"actor":{"display_login":"adaco"}}