{"action":"created","issue":{"url":"https://api.github.com/repos/thejameskyle/itsy-bitsy-data-structures/issues/20","repository_url":"https://api.github.com/repos/thejameskyle/itsy-bitsy-data-structures","labels_url":"https://api.github.com/repos/thejameskyle/itsy-bitsy-data-structures/issues/20/labels{/name}","comments_url":"https://api.github.com/repos/thejameskyle/itsy-bitsy-data-structures/issues/20/comments","events_url":"https://api.github.com/repos/thejameskyle/itsy-bitsy-data-structures/issues/20/events","html_url":"https://github.com/thejameskyle/itsy-bitsy-data-structures/issues/20","id":173760503,"number":20,"title":"Specify runtime difference between sorted/unsorted arrays","user":{"login":"Aweary","id":6886061,"avatar_url":"https://avatars.githubusercontent.com/u/6886061?v=3","gravatar_id":"","url":"https://api.github.com/users/Aweary","html_url":"https://github.com/Aweary","followers_url":"https://api.github.com/users/Aweary/followers","following_url":"https://api.github.com/users/Aweary/following{/other_user}","gists_url":"https://api.github.com/users/Aweary/gists{/gist_id}","starred_url":"https://api.github.com/users/Aweary/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/Aweary/subscriptions","organizations_url":"https://api.github.com/users/Aweary/orgs","repos_url":"https://api.github.com/users/Aweary/repos","events_url":"https://api.github.com/users/Aweary/events{/privacy}","received_events_url":"https://api.github.com/users/Aweary/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":10,"created_at":"2016-08-29T12:13:28Z","updated_at":"2016-09-01T06:21:59Z","closed_at":"2016-09-01T05:47:39Z","body":"On mobile so I can't get s PR going, but the table comparing basic DS runtimes for access/search/insert/delete should have a row for Array (sorted) and Array (unsorted), since they differ a lot.\r\n\r\nFor example, searching in a sorted array can be `O(lg n)` and insertion in an unsorted array is `O(1)`"},"comment":{"url":"https://api.github.com/repos/thejameskyle/itsy-bitsy-data-structures/issues/comments/243986852","html_url":"https://github.com/thejameskyle/itsy-bitsy-data-structures/issues/20#issuecomment-243986852","issue_url":"https://api.github.com/repos/thejameskyle/itsy-bitsy-data-structures/issues/20","id":243986852,"user":{"login":"Aweary","id":6886061,"avatar_url":"https://avatars.githubusercontent.com/u/6886061?v=3","gravatar_id":"","url":"https://api.github.com/users/Aweary","html_url":"https://github.com/Aweary","followers_url":"https://api.github.com/users/Aweary/followers","following_url":"https://api.github.com/users/Aweary/following{/other_user}","gists_url":"https://api.github.com/users/Aweary/gists{/gist_id}","starred_url":"https://api.github.com/users/Aweary/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/Aweary/subscriptions","organizations_url":"https://api.github.com/users/Aweary/orgs","repos_url":"https://api.github.com/users/Aweary/repos","events_url":"https://api.github.com/users/Aweary/events{/privacy}","received_events_url":"https://api.github.com/users/Aweary/received_events","type":"User","site_admin":false},"created_at":"2016-09-01T06:21:59Z","updated_at":"2016-09-01T06:21:59Z","body":"Cool, I totally understand where you're coming from!\r\n\r\n> The only thing that would change by distinguishing sorted and unsorted is searching\r\n\r\nNot true. If you did make the distinction then for unsorted arrays insertion would be `0(1)` and deletion would be `O(1)` as well if you already had the index/pointer to the item. It wouldn't make sense to make the distinction and then fall back to a normalized algorithm for evaluating insert/delete. \r\n\r\nBut yeah, I get that this might too granular for what you're wanting to explain here 👍 \r\n\r\n"}}
{"actor":{"display_login":"Aweary"}}