{"comment":{"url":"https://api.github.com/repos/KarmaKard/karma-app/comments/11397982","html_url":"https://github.com/KarmaKard/karma-app/commit/60eaefa69c06f67e6fe7fe0576105c84935f8705#commitcomment-11397982","id":11397982,"user":{"login":"tgroshon","id":1794859,"avatar_url":"https://avatars.githubusercontent.com/u/1794859?v=3","gravatar_id":"","url":"https://api.github.com/users/tgroshon","html_url":"https://github.com/tgroshon","followers_url":"https://api.github.com/users/tgroshon/followers","following_url":"https://api.github.com/users/tgroshon/following{/other_user}","gists_url":"https://api.github.com/users/tgroshon/gists{/gist_id}","starred_url":"https://api.github.com/users/tgroshon/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/tgroshon/subscriptions","organizations_url":"https://api.github.com/users/tgroshon/orgs","repos_url":"https://api.github.com/users/tgroshon/repos","events_url":"https://api.github.com/users/tgroshon/events{/privacy}","received_events_url":"https://api.github.com/users/tgroshon/received_events","type":"User","site_admin":false},"position":29,"line":37,"path":"client/app/stores/deals.js","commit_id":"60eaefa69c06f67e6fe7fe0576105c84935f8705","created_at":"2015-05-28T01:22:11Z","updated_at":"2015-05-28T01:22:11Z","body":"This works but it is an **O(n²)** algorithm which is *very* inefficient.  Can you think of why it may be inefficient and how it could be better?"}}