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

What is the default capacity of hashmap?

794

Can we store null in arraylist?

877

What is the difference between for and foreach loop?

916

What are dynamic data structures?

1252

Explain binary search tree?

916

Does treeset allow null?

810

What is the complexity of selection sort?

803

Can treeset contain duplicates?

887

Explain what are the types of collision resolution techniques and the methods used in each of the type?

882

How can we reverse the order in the treemap?

834

Explain the sorting algorithm that is most suitable to be used with single linked list?

793

Differentiate stack from array?

901

Explain what are the major data structures used in the rdbms?

918

Which sorting algorithm is best for small data?

827

Does mentioning the array name gives the base address in all the contexts?

1321