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 do you mean by priority queue?

881

What stack means?

857

How do you find the second largest element in an array of integers?

988

Explain linear linked implementation of Stack and Queue?

999

What is a hashset?

980

State the difference between queues and linked lists?

947

Is char array null terminated?

829

Is hashmap ordered?

907

What is a bubble sort and how do you perform it?

967

Which algorithm is used in arrays sort?

853

What is the difference between Strings and Arrays?

965

Explain binary search tree?

912

What is the capacity of arraylist?

876

What are sorting algorithms used for?

929

Does treemap sort automatically?

874