When is a binary search algorithm best applied?


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Data Structures Interview Questions

How to get a list of tables, views and columns in firebird database?

0 Answers  


what is Linked lists?

0 Answers  


What is mean by sorting?

0 Answers  


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

0 Answers  


Describe the complexity of Quick Sort

0 Answers   Honeywell, Zomato,






how a polynomial such as 6x^6+4x^3-2x+10 can be represnted by linked list?write an algorithm that reads such an polynomial

1 Answers  


1) Program A and B are analyzed and found to have worst- case running times no greater than 150nlog2n and n2 respectively.Answer the folloWing questions if possible.. i) which program has the better guarantee on the running time,for larger values of n(n>10000) ? ii) which program has the better guarantee on the running time,for small values of n(n<100) ? iii) which program will run faster on average for n =1000 2) wRite a program to compute the number of collisions required in a long random sequence of insertions using linear probing ,quadratic probing and double hashing 3) what is the optimal way to compute A1 A2 A3 A4 A5 A6 where the dimensions of the matrices are A1:10*20 A2 : 20 * 1 A3 : 1 * 40 A4 : 40*5 A5 : 5 * 30 A6 : 30 X 15

5 Answers   KPIT,


How to reverse a linked list iterative algorithm?

0 Answers  


what is atmost complete binary tree?

6 Answers  


Is unordered_map a hash table?

0 Answers  


Explain about set and their types in a collection?

0 Answers  


Why you need a data structure?

0 Answers  


Categories