linear search=n/2 binary search=iog2n,2 in the base of log.

what is a complexity of linear search,binery search?

Question Posted / hemant belwal

Answer Posted / hemant belwal

linear search=n/2
binary search=iog2n,2 in the base of log.

Is This Answer Correct ?

36 Yes

91 No

Please Help Members By Posting Answers For Below Questions

Define threaded binary tree. Explain its common uses

875

Where will be the free node available while inserting a new node in a linked list?

922

How long does it take to master data structures and algorithms?

1127

What are the tasks performed during postorder traversal?

947

What are the major data structures used in the following areas : network data model & hierarchical data model?

1026

Does treeset remove duplicates?

924

What is the best complexity of bubble sort?

915

Is treeset sorted?

951

What does quick sort do?

873

Explain the priority queue?

964

Differentiate between set and map.

1160

How does arraylist store data?

951

How can you insert a node in a random location of the linked list?

888

What do you know about the big-o notation and can you give some examples with respect to different data structures?

925

What is the difference between static and dynamic data?

988