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 vote147 views1 answer
Ejercicios con funciones en python
Python
2 votes151 views1 answer
Directory name python
Python
8 votes148 views3 answers
How to add two lists to an array variable
Python
2 votes161 views3 answers
Pytorch check if using gpu
Python
11 votes201 views3 answers
Python list except last element
Python
0 vote157 views1 answer
Bashrc rc meaning
Python
10 votes164 views1 answer
How to check version of pip in anaconda
Python
2 votes170 views1 answer
Python string remove whitespace and newlines
Python
-1 vote180 views2 answers
Python dict remove duplicates where items are not the same
Python
1 vote159 views1 answer
Pandas normalize groupby
Python