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 vote257 views1 answer
Python Hewwo wowwd
Python
0 vote267 views1 answer
Arima A date index has been provided, but it has no associated frequency information and so will be ignored when e.g. forecasting
Python
0 vote237 views1 answer
Loading kivy lang
Python
0 vote230 views1 answer
Timedelta64 total_mins
Python
0 vote270 views1 answer
Python - columns that contain the lengh of a string
Python
0 vote229 views2 answers
Jsonresponse status code django
Python
1 vote249 views1 answer
Plt normalized histogram
Python
0 vote299 views1 answer
Remove element from pack tkinter
Python
2 votes276 views1 answer
How to convert list to tensor pytorch
Python
-1 vote235 views1 answer
Explained if name main python
Python