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

3 votes145 views1 answer
Starting vscode on colab
Python
1 vote145 views2 answers
Pandas docs
Python
0 vote134 views1 answer
How to get one csv column in python
Python
0 vote156 views2 answers
Python thousands separators
Python
15 votes143 views5 answers
Timer in python
Python
5 votes167 views2 answers
Importing python module from different directory
Python
1 vote144 views1 answer
Libreoffice add line in table
Python
0 vote262 views3 answers
Retrieve content inside the meta tag python
Python
1 vote135 views1 answer
Numpy subarray python
Python
0 vote152 views1 answer
Shutil.make_archive
Python