Skip to main content
Software Engineering

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.

Required fields*

9
  • 15
    This question is strange: you don't favor X over Y just because X has some properties (in isolation). You favor X over Y because X has some properties which give an advantage when compared to the related properties of Y. But in your case, you did not even mention "Y", so why should one avoid X? Commented Oct 5, 2021 at 18:56
  • 15
    See also: What is O(...) and how do I calculate it? Commented Oct 5, 2021 at 18:59
  • 1
    @DocBrown I'm not asking why binary searching is faster, nor if I should favor it over my currently implemented solution. I'm asking what is meant by complexity, what those complexities are in binary searching, and what the table posted conveys, related to that information. As such, the Y is irrelevant to my question. Commented Oct 5, 2021 at 19:05
  • 6
    It's poor terminology or poor writing. They are referring to the computational complexity, given in Big-O notation. Commented Oct 6, 2021 at 3:39
  • 2
    @user207421 lack of knowledge and as a result, poor terminology. I'm self taught and just never needed to know this level of detail when it comes to optimization. As such, I had never heard about time complexity prior to the research that fueled this post. Commented Oct 6, 2021 at 15:36