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 vote278 views1 answer
RuntimeError: Please use tf.experimental.tensorrt.Converter in TF 2.0. site:stackoverflow.com
Python
0 vote247 views1 answer
Group a dataset
Python
0 vote265 views1 answer
Python format inverse
Python
1 vote249 views1 answer
Message box on closing window event in tkinter
Python
15 votes253 views3 answers
Send image discord.py
Python
6 votes259 views9 answers
E
Python
0 vote274 views1 answer
Top gun: maverick
Python
34 votes233 views1 answer
Python main file with class
Python
0 vote253 views1 answer
Fibonacci numbers function python print
Python
1 vote256 views2 answers
Convertir datetime to timestamp django
Python