a sorting techn
ique is called stable if it
Answers
Answered by
0
Answer:
A sorting algorithm is said to be stable if two objects with equal keys appear in the same order in sorted output as they appear in the input unsorted array. Some sorting algorithms are stable by nature like Insertion sort, Merge Sort, Bubble Sort, etc
Explanation:
Similar questions
Social Sciences,
7 months ago
English,
1 year ago