A

Admin • 828.03K Points
Coach

Q. A sorting algorithm is stable if

  • (A) its time complexity is constant irrespective of the nature of input
  • (B) preserves the original order of records with equal keys
  • (C) its space complexity is constant irrespective of the nature of input
  • (D) it sorts any volume of data in a constant time

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.