6 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 370
Correct 53
Incorrect 122
Viewed 195

Answers

Guest
Guest
Poonam Singla - 5 years ago

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

Abdelrahman S. Fathy
Abdelrahman S. Fathy - 3 months ago

Abdelrahman S. Fathy from Cairo, Egypt is saying merge sort is correct answer

Sanju Rebel
Sanju Rebel - 6 months ago

Sanju Rebel from Hyderabad, India is saying merge sort is correct answer

esraa nashat
esraa nashat - 7 months ago

esraa nashat from Cairo, Egypt is saying insertion sort is correct answer

Serkie Mekonnen
Serkie Mekonnen - 8 months ago

Serkie Mekonnen from Dessie, Ethiopia is saying insertion sort is correct answer

Related Questions

A vertex of degree one is called

  • [A] padent
  • [B] isolated vertex
  • [C] null vertex
  • [D] colored vertex

Merge sort uses ?

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