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 vote296 views1 answer
Python absolute path from projectr
Python
1 vote317 views1 answer
Portscan with python
Python
2 votes386 views10 answers
Convert python code to c++ online
Python
0 vote310 views1 answer
Typehinting with when parameter has default
Python
0 vote326 views1 answer
Django route accept params with character
Python
0 vote307 views1 answer
"DO_NOTHING" is not defined django
Python
1 vote302 views1 answer
Python sort list of strings numerically
Python
11 votes238 views5 answers
Encryption and decryption in python
Python
2 votes323 views1 answer
Clone website in python
Python
0 vote374 views1 answer
Decode in django templates
Python Django