Which of the following algorithm design technique is used in the quick sort algorithm?
merna peter is saying Dynamic programming is correct answer
Narender Kumar is saying Divide and conquer is correct answer
Marem Husen from Al Musayyib, Iraq is saying Divide and conquer is correct answer
deepak kumar is saying Divide and conquer is correct answer
Uga Balu from Chennai, India is saying Divide and conquer is correct answer
Which one of the following permutations can be obtained the output using stack assuming that the input is the sequence 1,2,3,4,5 in that order ?
- [A] 3,4,5,1,2
- [B] 3,4,5,2,1
- [C] 1,5,2,3,4
- [D] 5,4,3,1,2
The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?
- [A] 2 deletions and 3 additions
- [B] 3 additions and 2 deletions
- [C] 3 deletions and 3 additions
- [D] 3 deletions and 4 additions
- [A] Insertion sort
- [B] Binary search
- [C] Radix sort
- [D] Polynomial manipulation