Are logN and (lognN) same

O(1) (in the worst case): Given the page that a business's name is on and the business name, find the phone number.

O(1) (in the average case): Given the page that a person's name is on and their name, find the phone number.

O(log n): Given a person's name, find the phone number by picking a random point about halfway through the part of the book you haven't searched yet, then checking to see whether the person's name is at that point. Then repeat the process about halfway through the part of the book where the person's name lies. (This is a binary search for a person's name.)

O(n): Find all people whose phone numbers contain the digit "5".

O(n): Given a phone number, find the person or business with that number.

O(n log n): There was a mix-up at the printer's office, and our phone book had all its pages inserted in a random order. Fix the ordering so that it's correct by looking at the first name on each page and then putting that page in the appropriate spot in a new, empty phone book.

Source: stackoverflow.com

Similar codes

0 vote317 views1 answer
Brython implemantation
Python
0 vote303 views1 answer
Python dataframe appendisnt showing
Python
-1 vote325 views1 answer
Django template filter
Python
4 votes258 views2 answers
Attributeerror: module 'tensorflow' has no attribute 'session'
Python
2 votes372 views1 answer
Is python easier than javascript
Python
5 votes399 views3 answers
Jupyter dark theme vampire
Python
3 votes309 views2 answers
Python replace values in a matrix
Python
2 votes316 views1 answer
Minimal flask application import
Python
0 vote326 views2 answers
Check anonim user django
Python
17 votes333 views2 answers
How to use headless browser in selenium python
Python