A

Admin • 802.91K Points
Coach

Q. A sort which iteratively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called

  • (A) insertion sort
  • (B) selection sort
  • (C) heap sort
  • (D) quick sort

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.