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

4 votes185 views1 answer
Matplotlib plot dashed
Python
4 votes198 views1 answer
Get current url python
Python
3 votes191 views1 answer
Python split lines
Python
0 vote179 views1 answer
Compile python folder
Python
0 vote208 views1 answer
How to bulk update in mongodb using python
Python
14 votes187 views6 answers
Dark mode jupyter notebook
Python
0 vote233 views1 answer
Get admin url of instance django
Python Django
3 votes173 views1 answer
Sklearn train_test_split
Python
1 vote182 views1 answer
Remove duplicate columns python dataframe
Python
0 vote183 views1 answer
Uniqe points in a column pandas
Python