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

1 vote169 views1 answer
Pandas nan values in column
Python
0 vote194 views1 answer
Python - Comment supprimer Commas de la corde
Python
2 votes159 views3 answers
Fibonacci formula python
Python
0 vote197 views1 answer
Decorator patter
Python
6 votes166 views3 answers
Python -m pip install
Python
0 vote155 views1 answer
Groovey set variable
Python
23 votes172 views4 answers
No module named 'requests' python
Python
1 vote156 views1 answer
Python sort a list by a custom order
Python
0 vote172 views2 answers
Numpy reg ex delete words before a specific character
Python
-1 vote228 views1 answer
Install grepper for edge
Python