What is a stable algorithm?
- 1 Answers
- 1024 Views
- I also Faced
- E-Mail Answers
Answer / Najir Husen
A stable sorting algorithm preserves the relative order of equal elements in the input collection. That means that if there are multiple equal elements, they will maintain their original position within the sorted output.
| Is This Answer Correct ? | 0 Yes | 0 No |
applications of stacks and their uses?
How many types of data structures are there?
Sorting is not possible by using which of the following methods? (a) Insertion (b) Selection (c) Exchange (d) Deletion
Can we increase the size of statically allocated array?
What are the objectives of studying data structures?
Why do we need algorithm?
What are the basic data structures?
Is hashtable throw concurrentmodificationexception?
Is there any difference between int[] a and int a[]?
How does sort function work?
Why hashmap is faster than hashset?
Why is data structure important?
Windows 
