Why do we use insertion sort?


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

Post New Answer

More Data Structures Interview Questions

How many types of arrays are there?

0 Answers  


What are the standard ways in which a graph can be traversed?

0 Answers  


what are the applications that use Linked lists?

0 Answers  


What is the advantage of the heap over a stack?

0 Answers  


What is the difference between classifying and sorting?

0 Answers  






What is difference between list set and map?

0 Answers  


State the rules to be followed during infix to postfix conversions?

0 Answers  


Explain what are the major data structures used in the rdbms?

0 Answers  


Describe linear probing with an example.

0 Answers  


What are the advantages of sorting?

0 Answers  


Differentiate among cycle, path, and circuit?

0 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,


Categories