Computer-Networks
October 28, 2023Database-Management-System
October 28, 2023Sorting
|
Question 32
|
What is meant by stable sorting algorithm?
|
A sorting algorithm is stable if it preserves the order of all keys
|
|
|
A sorting algorithm is stable if it preserves the order of non-duplicate keys
|
|
|
A sorting algorithm is stable if it preserves the order of duplicate keys
|
|
|
A sorting algorithm is stable if it doesn’t preserve the order of duplicate keys
|
Question 32 Explanation:
A sorting algorithm is called stable if it preserves the order of duplicate keys.
The examples of sorting algorithms are insertion sort,merge sort,counting sort etc.
The examples of sorting algorithms are insertion sort,merge sort,counting sort etc.
Correct Answer: C
Question 32 Explanation:
A sorting algorithm is called stable if it preserves the order of duplicate keys.
The examples of sorting algorithms are insertion sort,merge sort,counting sort etc.
The examples of sorting algorithms are insertion sort,merge sort,counting sort etc.
Subscribe
Login
0 Comments