For Linear Search Complexity Is :- O(n). For Binary Search Complexity Is :

what is a complexity of linear search,binery search?

Question Posted / pratik wavhal

Answer Posted / pratik wavhal

For Linear Search Complexity Is :- O(n).
For Binary Search Complexity Is :- O(log(at base 2)n).

Is This Answer Correct ?

8 Yes

4 No

Please Help Members By Posting Answers For Below Questions

How do you find the time complexity of a bubble sort?

848

What is the difference between file structure and storage structure?

1017

Does treeset allow null?

846

What is static array?

968

Describe linear probing with an example.

983

Does hashmap preserve insertion order?

883

Write a data structure for a queue.

1234

List out the advantages of using a linked list?

854

What is meant by a dynamic array?

946

What are the types of data structures?

1138

What is the impact of signed numbers on the memory?

942

How does insertion sort works?

871

What is array indexing?

1025

What are the categories of avl rotations?

991

Can you sort a hashmap?

854