{"action":"created","issue":{"url":"https://api.github.com/repos/numpy/numpy/issues/12186","repository_url":"https://api.github.com/repos/numpy/numpy","labels_url":"https://api.github.com/repos/numpy/numpy/issues/12186/labels{/name}","comments_url":"https://api.github.com/repos/numpy/numpy/issues/12186/comments","events_url":"https://api.github.com/repos/numpy/numpy/issues/12186/events","html_url":"https://github.com/numpy/numpy/issues/12186","id":370759499,"node_id":"MDU6SXNzdWUzNzA3NTk0OTk=","number":12186,"title":"sort should have an algorithm with 'best' complexity for nearly sorted data","user":{"login":"jondo","id":21648,"node_id":"MDQ6VXNlcjIxNjQ4","avatar_url":"https://avatars3.githubusercontent.com/u/21648?v=4","gravatar_id":"","url":"https://api.github.com/users/jondo","html_url":"https://github.com/jondo","followers_url":"https://api.github.com/users/jondo/followers","following_url":"https://api.github.com/users/jondo/following{/other_user}","gists_url":"https://api.github.com/users/jondo/gists{/gist_id}","starred_url":"https://api.github.com/users/jondo/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/jondo/subscriptions","organizations_url":"https://api.github.com/users/jondo/orgs","repos_url":"https://api.github.com/users/jondo/repos","events_url":"https://api.github.com/users/jondo/events{/privacy}","received_events_url":"https://api.github.com/users/jondo/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":17,"created_at":"2018-10-16T19:16:11Z","updated_at":"2018-10-27T09:29:56Z","closed_at":null,"author_association":"NONE","body":"I have got a large amount of data that is nearly sorted.\r\nAs e.g. nicely shown in [these animations](https://www.toptal.com/developers/sorting-algorithms/nearly-sorted-initial-order), a simple insertion sort could be the fastest in this case.\r\n\r\nSo I suggest offering this as an additional algorithm for the 'kind' argument.\r\n\r\n(I also found [a corresponding SO question](https://stackoverflow.com/questions/5176060/insertion-sort-in-numpy).)"},"comment":{"url":"https://api.github.com/repos/numpy/numpy/issues/comments/433605584","html_url":"https://github.com/numpy/numpy/issues/12186#issuecomment-433605584","issue_url":"https://api.github.com/repos/numpy/numpy/issues/12186","id":433605584,"node_id":"MDEyOklzc3VlQ29tbWVudDQzMzYwNTU4NA==","user":{"login":"liwt31","id":22628546,"node_id":"MDQ6VXNlcjIyNjI4NTQ2","avatar_url":"https://avatars3.githubusercontent.com/u/22628546?v=4","gravatar_id":"","url":"https://api.github.com/users/liwt31","html_url":"https://github.com/liwt31","followers_url":"https://api.github.com/users/liwt31/followers","following_url":"https://api.github.com/users/liwt31/following{/other_user}","gists_url":"https://api.github.com/users/liwt31/gists{/gist_id}","starred_url":"https://api.github.com/users/liwt31/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/liwt31/subscriptions","organizations_url":"https://api.github.com/users/liwt31/orgs","repos_url":"https://api.github.com/users/liwt31/repos","events_url":"https://api.github.com/users/liwt31/events{/privacy}","received_events_url":"https://api.github.com/users/liwt31/received_events","type":"User","site_admin":false},"created_at":"2018-10-27T09:29:56Z","updated_at":"2018-10-27T09:29:56Z","author_association":"CONTRIBUTOR","body":"I'd prefer tim sort. It is well studied, benchmarked and tested in practice. After it's implemented we can do some benchmarks to decide if it should replace the old merge sort or not."}}
{"actor":{"display_login":"liwt31"}}