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

1 vote138 views1 answer
Python convert querydict to dict
Python
22 votes127 views3 answers
Python except error as e
Python
2 votes136 views1 answer
How to make python3.9 active
Python
2 votes141 views1 answer
Python 3.7 tutorial pdf with exercises
Python
2 votes147 views1 answer
Pygame get screen width and height
Python
0 vote134 views1 answer
Is assimilation part of digestive system
Python
0 vote192 views1 answer
Python print stderr
Python
1 vote134 views1 answer
Sql alchemy engine all tables
Python
200 votes187 views11 answers
Pip upgrade python
Python
3 votes132 views5 answers
See tensorflow version python
Python