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 vote272 views1 answer
Trim string to max length python
Python
11 votes274 views4 answers
Flask debug
Python
0 vote299 views1 answer
Signup class
Python
-1 vote322 views1 answer
Uninstall python3.8 ubuntu
Python
234 votes551 views6 answers
Random in python
Python
0 vote328 views2 answers
Python all option
Python
0 vote297 views2 answers
Pandas column rgeex doesnot contain
Python
9 votes271 views2 answers
How to install packages inside thepython script
Python
0 vote265 views1 answer
Find the first occurrence of item in a list in python
Python
1 vote290 views1 answer
Python strftime microseconds
Python