Science, asked by vishalanand88, 1 year ago

a sorting techn

ique is called stable if it

Answers

Answered by vibhormukeriya

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:

Previous Question

Next Question

Similar questions

Social Sciences, 7 months ago

4. Assertion and Reason: Assertion (A): A large part of the Balkans was under the control of the Ottoman Empire. Reason (R): The spread of the ideas of romantic nationalism in the Balkans together with the disintegration of the Ottoman Empire made this region very explosive. Options are: (a) Both (A) and (R) are true and (R) is the correct explanation of (A) (b) Both (A) and (R) are true but...

Science, 7 months ago

long ago earth is covered with rocks. is it true or false...

Computer Science, 7 months ago

what is Topology ?tell me fast it is urgent...

English, 1 year ago

WRITE ALPHABETS IN HINGLISH...