Which recursive sorting technique always makes recursive calls to sort subarrays that are about half size of the original array?


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

Post New Answer

More C++ General Interview Questions

What are the advantages of pointers?

0 Answers  


what is COPY CONSTRUCTOR and what is it used for?

0 Answers  


What will happen if when say delete this ?

7 Answers  


What are advantages of C++ when comparing with C?

18 Answers   HP, iGate, TCS,


Is c++ free?

0 Answers  






What number of digits that can be accuratly stored in a float (based on the IEEE Standard 754)? a) 6 b) 38 c) An unlimited number

0 Answers  


What is the difference between a "copy constructor" and an "assignment operator" in C++?

0 Answers   Genpact,


Is there anything you can do in C++ that you cannot do in C?

1 Answers  


Describe functional overloading?

6 Answers   HP,


Evaluate: int fn(int v) { if(v==1 || v==0) return 1; if(v%2==0) return fn(v/2)+2; else return fn(v-1)+3; } for fn(7); a) 10 b) 11 c) 1

4 Answers   Quark,


What is the use of register keyword with the variables?

0 Answers  


How do I make turbo c++ full screen?

0 Answers  


Categories