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

2 votes186 views2 answers
If else in dictionary comprehension python
Python
0 vote195 views1 answer
How to format a matrix to align all rows python
Python
0 vote280 views1 answer
Eval how
Python
-1 vote273 views1 answer
Random forest classifier in python
Python
1 vote198 views1 answer
Append to list in dictionary python if exists
Python
18 votes256 views4 answers
Flask page
Python
-1 vote204 views2 answers
How to sum numpy matrix diagonal
Python
0 vote183 views1 answer
How to get location using python
Python
2 votes195 views1 answer
Show rows with a null value pandas
Python
65 votes179 views6 answers
Spanish dictionary
Python