Skip to main content
Computer Science

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

11
  • $\begingroup$ hmmmm.... it could be a thing but I find it hard to believe $\endgroup$ Commented Dec 22, 2024 at 20:23
  • $\begingroup$ @Irdis What's hard to believe? $\endgroup$ Commented Dec 22, 2024 at 20:28
  • $\begingroup$ your statement. I see the point that each time we spend log time to find insertion point, so it has to be like n log n. But using the same argument, I can say every time we spend linear time to find insertion point in linear version, so it has to be the square time. But it is incorrect. $\endgroup$ Commented Dec 22, 2024 at 20:34
  • 1
    $\begingroup$ I actually think you are right and it is simple as that, in the worst case for bin search when elements to insert are sorted in the same direction, linear version would clearly outperform. $\endgroup$ Commented Dec 22, 2024 at 23:04
  • 1
    $\begingroup$ @Irdis Tip for the future just in case you didn't know: There's no rush with awarding bounties. You had "paid" for a week of extra attention that could've attracted more/better answers (while I do think mine is pretty much all that needed to be said, more could be said). If you do what D.W. requested, maybe they'll still post something interesting. $\endgroup$ Commented Dec 23, 2024 at 17:43