{"action":"opened","issue":{"url":"https://api.github.com/repos/ericdrowell/BigOCheatSheet/issues/93","labels_url":"https://api.github.com/repos/ericdrowell/BigOCheatSheet/issues/93/labels{/name}","comments_url":"https://api.github.com/repos/ericdrowell/BigOCheatSheet/issues/93/comments","events_url":"https://api.github.com/repos/ericdrowell/BigOCheatSheet/issues/93/events","html_url":"https://github.com/ericdrowell/BigOCheatSheet/issues/93","id":82824911,"number":93,"title":"Should make the difference between comparison sorting and others","user":{"login":"aureooms","id":5165674,"avatar_url":"https://avatars.githubusercontent.com/u/5165674?v=3","gravatar_id":"","url":"https://api.github.com/users/aureooms","html_url":"https://github.com/aureooms","followers_url":"https://api.github.com/users/aureooms/followers","following_url":"https://api.github.com/users/aureooms/following{/other_user}","gists_url":"https://api.github.com/users/aureooms/gists{/gist_id}","starred_url":"https://api.github.com/users/aureooms/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/aureooms/subscriptions","organizations_url":"https://api.github.com/users/aureooms/orgs","repos_url":"https://api.github.com/users/aureooms/repos","events_url":"https://api.github.com/users/aureooms/events{/privacy}","received_events_url":"https://api.github.com/users/aureooms/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2015-05-30T14:25:43Z","updated_at":"2015-05-30T14:25:43Z","closed_at":null,"body":"Comparing bucketsort to quicksort is like comparing apples and oranges. It is also important to understand that O(n log n) for comparison sorting is asymptotically optimal (up to a constant factor), and so it should not be *``Bad''*."}}