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 vote239 views1 answer
Python split input to list
Python
4 votes229 views3 answers
How to use random tree in python
Python
0 vote233 views1 answer
Pyplot legend outside figure
Python
17 votes204 views6 answers
How to append to a list in python
Python
48 votes238 views4 answers
Console clear python
Python
9 votes214 views6 answers
Lists in python
Python
54 votes315 views2 answers
How to run django requirement.txt
Python Django
0 vote249 views1 answer
Reverse row order padnas
Python
0 vote212 views1 answer
The dropping of sediment by water wind and ice or gravity is known as
Python
1 vote219 views1 answer
Pangram function
Python