o(n)= linear o(log n)(base 2)= binary bcz in linear v search one be one w

what is a complexity of linear search,binery search?

Question Posted / lokesh bhatt

Answer Posted / lokesh bhatt

o(n)= linear
o(log n)(base 2)= binary
bcz in linear v search one be one while in binary v divide array in two part every time

Is This Answer Correct ?

15 Yes

4 No

Please Help Members By Posting Answers For Below Questions

What is an ordered map?

862

How do you do a mergesort?

849

Difference between hashset and treeset?

986

What is a directed graph?

901

What do you mean by sorting?

786

Is hashmap keyset ordered?

955

What is the difference between data types and data structures?

863

What is the minimum number of nodes in an avl tree of height h?

831

Are hash tables ordered?

857

What is the time complexity of arrays sort?

803

Describe linear probing with an example.

933

Two linked lists are given, find out the sum of them without altering the linked list?

919

What are different types of algorithms?

848

Define static data structures?

925

Can we increase the size of statically allocated array?

839