A stable sorting algorithm −

PYQ Hexaware Hiring Assessment 2023

A stable sorting algorithm −

  1. A.

    does not crash.

  2. B.

    does not run out of memory.

  3. C.

    does not change the sequence of appearance of elements.

  4. D.

    does not exists.

Attempted by 648 students.

Sign up free to check your answer

Sign up free

Explore the full course: Cdac C Cat Complete Preparation

Loading lesson…