{"repository":{"created_at":"2012-10-13T10:50:41-07:00","description":"Assignment 1 of CSE150. We must implement several different algorithms to solve a puzzle that wishes to arrange numbers from 0 to m*n-1 in a matrix","owner":"akallu","open_issues":0,"pushed_at":"2012-10-16T17:43:07-07:00","forks":0,"has_downloads":true,"fork":false,"size":128,"has_issues":true,"language":"Python","watchers":0,"private":false,"has_wiki":true,"stargazers":0},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/akallu/CSE150-A1/compare/bd8ea5f209...63c56b2f36"}