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

List the basic operations carried out in a linked list?

977

How do you find the complexity of a bubble sort?

788

What do you mean by Runtime Error

964

Can we add duplicate keys in a hashmap? What will happen if we attempt to add duplicate values?

787

Define heap?

992

Which programming language is best for data structures?

838

Tell me why might quick sort might be better than merge sort?

870

Define a right-skewed binary tree?

881

Does list allow null values?

869

How can you insert a node at the end of linked list?

811

How many sorting algorithms are there?

928

Write a program to reverse a single linked list.

894

What is time complexity of hashmap?

988

Briefly explain recursive algorithm 50 how do you search for a target key in a linked list?

896

Is quicksort divide and conquer?

847