{"repository":{"description":"C++ program profiling three different algorithms of different complexities which solve the maximum subarray problem. Illustrates high-scrutiny empirical analysis of algorithmic performance.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":156,"owner":"CoryG89","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C++","created_at":"2013-08-03T18:09:08-07:00","pushed_at":"2013-08-03T19:36:47-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Cory Gross","blog":"http://thedev-log.blogspot.com","location":"Auburn University","email":"1e0bc5baa20af05e79e4df11a99302b06f59c83b@gmail.com"},"url":"https://github.com/CoryG89/MaximumSubarray/compare/4cad996dc9...6eff5a8b9f"}