Binarysearch is faster than sequential search

Which one is faster?
A binary search of an orderd set of elements in an array
or
a sequential search of the elements.

Question Posted / uma sankar reddy.p

Answer Posted / uma sankar reddy.p

Is This Answer Correct ?

0 Yes

0 No

Please Help Members By Posting Answers For Below Questions

Explain extended binary tree.

957

How helpful is abstract data type of data structures?

858

How many types of linked lists are there?

895

Can hashtable have duplicate values?

903

What is ds heap sort?

899

What do you mean by priority queue?

925

Which sorting is used in collections sort?

864

A lot of data structures related programs related to only trees and graphs, like the diameter of a tree, removing the loops in a graph etc.

1025

What is example of data?

1086

What is the minimization factor and time complexity of b-tree?

1128

What does the dummy header in linked list contain?

1096

How is bubble sort done?

835

Is it possible to make an array volatile in java?

904

Why do we need linked lists?

918

What are the different types of sorting in data structure?

1003