You are viewing a single comment's thread. Return to all comments →
Isn't bisect.insort implemented with the list.insert function, which is usually O(n), which gives total O(n^2)? How does this manage to run that fast?
Seems like cookies are disabled on this browser, please enable them to open this website
Tries: Contacts
You are viewing a single comment's thread. Return to all comments →
Isn't bisect.insort implemented with the list.insert function, which is usually O(n), which gives total O(n^2)? How does this manage to run that fast?