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

How many types of data structures are there?

1196

What is the difference between array sort () and array sort t >()?

896

Define non-linear data structures?

1090

Define rehashing?

1111

What is meant by deque?

975

In what areas do data structures are applied?

1009

What is the meaning of arraylist?

986

Why we need cursor implementation of linked lists?

1053

Is heap sort faster than quicksort?

883

Explain the uses of matrix with an example?

1058

What is difference between data type and data structure?

869

What is the time complexity of arrays sort?

911

What is application of data structure?

945

What is the types of data structure?

1086

Define the queue data structure.

1125