What is the best case for linear search ? - Study24x7
Social learning Network

Warning: include(./views/auth.php): failed to open stream: Permission denied in /var/www/html/live/loginRightSlider.php on line 18

Warning: include(): Failed opening './views/auth.php' for inclusion (include_path='.:/usr/share/php') in /var/www/html/live/loginRightSlider.php on line 18
Java Object oriented programming
47 followers study24x7 21 Jul 2021 11:45 AM study24x7 study24x7

What is the best case for linear search ?

Big Data & Analytics
Like Comment | 1 Share
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

    Like
    Reply 21 Jul 2021 11:48 AM
    Related Questions
    500+   more Questions to answer

    Get the App

    Download the Study24x7 App, so you can connect and collaborate.

    study24x7
    study24x7
    Most Related Articles