7 years ago in Data Structure

Which of the following is useful in implementing quick sort?

[A] Stack
[B] Set
[C] List
[D] Queue
Loading...
Next Question

Overall Stats

Attempted 252
Correct 35
Incorrect 76
Viewed 141

Answers

Guest
Guest
samurai kensai
samurai kensai - 3 months ago

samurai kensai is saying Stack is correct answer

yogesh rodge
yogesh rodge - 4 years ago

yogesh rodge from India is saying List is correct answer

Lets Know
Lets Know - 4 years ago

Lets Know from Pakistan is saying List is correct answer

Rohan Bhosale
Rohan Bhosale - 4 years ago

Rohan Bhosale from Pune, India is saying Queue is correct answer

Mihir Shah
Mihir Shah - 4 years ago

Mihir Shah from Majalgaon, India is saying Queue is correct answer

Related Questions

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

Linked list are not suitable data structure of which one of the following problems ?

  • [A] Insertion sort
  • [B] Binary search
  • [C] Radix sort
  • [D] Polynomial manipulation