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

Why do we use trees in data structures?

899

List the differences between comparable and comparator interface?

925

What happens when arraylist is full?

989

Which is faster hashmap or treemap?

889

What are the disadvantages of sequential storage?

1241

What is meant by linked list?

917

How do you clear a stack?

922

What is pivot in quicksort?

897

What are the tasks performed during postorder traversal?

947

What are common data structures?

1013

Write a recursive c function to calculate the height of a binary tree.

906

Define primary clustering?

934

What is a string array?

916

What is the function of stack?

833

How can you correct these errors?

981