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 vote338 views1 answer
How to fix invalid salt in python flask
Python Flask
0 vote252 views1 answer
Legend for pie chart matplotlib
Python
0 vote227 views2 answers
Initialize boolean list of size python
Python
12 votes268 views6 answers
List python
Python
0 vote252 views1 answer
How to install proxy pool in scrapy?
Python
0 vote394 views1 answer
Create a thumbnail from video python
Python
0 vote256 views1 answer
Extract label from tf data
Python
0 vote288 views1 answer
Jupyter nbconvert
Python
0 vote277 views2 answers
Pyhton image resize
Python
0 vote277 views1 answer
Presto sequence example date
Python