7 years ago in Data Structure

Queue can be used to implement ?

[A] quick sort
[B] merge sort
[C] heap sort
[D] insertion sort
Loading...
Next Question

Overall Stats

Attempted 243
Correct 30
Incorrect 76
Viewed 137

Answers

Guest
Guest
Poonam Singla - 6 years ago

Queue can be used to implement heap sort..not for quick sort.this is implemented by stack

Lets Know
Lets Know - 4 years ago

Lets Know from Pakistan is saying heap sort is correct answer

Rohan Bhosale
Rohan Bhosale - 4 years ago

Rohan Bhosale from Pune, India is saying insertion sort is correct answer

Rohan Bhosale
Rohan Bhosale - 4 years ago

Rohan Bhosale from Pune, India is saying insertion sort is correct answer

Mihir Shah
Mihir Shah - 4 years ago

Mihir Shah from Majalgaon, India is saying heap sort is correct answer

Related Questions

Merge sort uses ?

  • [A] Divide and conquer strategy
  • [B] Backtracking approach
  • [C] Heuristic search
  • [D] Greedy approach

Which of the following algorithm design technique is used in the quick sort algorithm?

  • [A] Dynamic programming
  • [B] Backtracking
  • [C] Divide and conquer
  • [D] Greedy method