No, Above answer is wrong. The complexity of Linear search is O(n) and B

what is a complexity of linear search,binery search?

Question Posted / geetika sharma

Answer Posted / geetika sharma

No, Above answer is wrong. The complexity of Linear search
is O(n) and
Binary search is O(log n) at the base 2

Is This Answer Correct ?

212 Yes

9 No

Please Help Members By Posting Answers For Below Questions

Is hashmap ordered?

912

Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)

1365

What is difference between hashtable and hashmap?

966

Is array immutable?

860

What is a static structure?

879

How many times is merge sort called?

856

Does array sort mutate?

776

Why do we need to use computers to help us sort lists?

876

How can you correct these errors?

922

Which language is best for data structures?

912

Does arraylist contain duplicates?

840

Can we change load factor of hashmap?

844

What is the slowest sorting algorithm?

861

What is map data structure?

847

What is hashing technique?

895