{"repository":{"description":"This is C project for a class Investigación de Operaciones at Instituto Technológico de Costa Rica. Purpouse of this project is solving the knapsack problem and optimal binary search tree problem.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":136,"owner":"apelttom","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C","created_at":"2013-09-19T07:03:07-07:00","pushed_at":"2013-09-19T10:16:45-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Tom Apeltauer","company":"CTU","blog":"None","location":"Prague - Czech Republic","email":"2d5ae0bec6be098873789c33a5f32821a5240e7a@seznam.cz"},"url":"https://github.com/apelttom/2013-09-27--IO-Project/compare/2e8dc84e6f...4f688f5825"}