What is the best case for linear search ? - Study24x7
Social learning Network
45 followers study24x7 21 Jul 2021 11:45 AM study24x7 study24x7

What is the best case for linear search ?

study24x7
Write a comment
  • Edubabble LLP
  • In a linear search, best-case complexity is O(1) and worst-case complexity is O(10000). In a binary search, best-case complexity is O(1) and worst-case complexity is O(log210000)=O(13.287).

    See more

    Related Questions
    500+   more Questions to answer
    Most Related Articles