Linear Search-O(n) Binary Search-O(log n)

what is a complexity of linear search,binery search?

Question Posted / ankita dey

Answer Posted / ankita dey

Linear Search-O(n)
Binary Search-O(log n)

Is This Answer Correct ?

48 Yes

5 No

Please Help Members By Posting Answers For Below Questions

Describe tree database.

944

Treemap orders the elements on which field?

975

What is difference between capacity and size of arraylist?

1118

Can we add duplicate keys in a hashmap?

959

What are the different types of hash functions?

1001

Can we add or delete an element after assigning an array?

1104

What are the classification of data structures?

986

What is the complexity of selection sort?

894

Can sets contain duplicates?

882

What is the use of sorting the data?

976

What is the purpose of sorting?

976

What do you mean by an Array?

995

Explain about map and their types?

1064

What is map keyset?

934

Define depth and height of a node?

965