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 vote281 views3 answers
Pandas python tutorial
Python
28 votes271 views4 answers
Seaborn figure size
Python
0 vote289 views1 answer
Split() vs split(' ')
Python
0 vote277 views1 answer
Python open dicom file
Python
16 votes287 views3 answers
How to code music in python
Python
0 vote258 views1 answer
Saaaaaaaaaaaaa
Python
27 votes283 views4 answers
How to do a square root in python
Python
8 votes301 views3 answers
Django order by
Python Django
0 vote290 views1 answer
Numpy euclidean distance matrix broadcasting
Python
0 vote262 views1 answer
Importando todo o pacote em python
Python