{"comment":{"url":"https://api.github.com/repos/kirascheibelhut/99schemeproblems/comments/14806554","html_url":"https://github.com/kirascheibelhut/99schemeproblems/commit/7f3f7750d96259dd9dfb2c08483d19e69295f249#commitcomment-14806554","id":14806554,"user":{"login":"scheibo","id":117249,"avatar_url":"https://avatars.githubusercontent.com/u/117249?v=3","gravatar_id":"","url":"https://api.github.com/users/scheibo","html_url":"https://github.com/scheibo","followers_url":"https://api.github.com/users/scheibo/followers","following_url":"https://api.github.com/users/scheibo/following{/other_user}","gists_url":"https://api.github.com/users/scheibo/gists{/gist_id}","starred_url":"https://api.github.com/users/scheibo/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/scheibo/subscriptions","organizations_url":"https://api.github.com/users/scheibo/orgs","repos_url":"https://api.github.com/users/scheibo/repos","events_url":"https://api.github.com/users/scheibo/events{/privacy}","received_events_url":"https://api.github.com/users/scheibo/received_events","type":"User","site_admin":false},"position":111,"line":111,"path":"99schemeproblems.rkt","commit_id":"7f3f7750d96259dd9dfb2c08483d19e69295f249","created_at":"2015-12-06T01:54:31Z","updated_at":"2015-12-06T01:54:31Z","body":"also - besides being more mouthy, append (list (car items)) will probably be slightly slower than cons (unless the compiler is smart and optimizes it away...). that being said, its still O(1) because (list (car items)) is always length 1. in reverse, the list we're appending to is growing which is why it becomes O(n^2)"}}