What Is a Stable Algorithm?

In Computer Science, a Stable Sorting Algorithm Preserves the Order of Records with Equal Keys. in Numerical Analysis, a Numerically Stable Algorithm Avoids Magnifying Small Errors. an Algorithm Is Stable If the Result Produced Is Relatively Insensitive to Perturbations During Computation.

Which Algorithm Is Stable Algorithm?

Some Examples of Stable Algorithms Are Merge Sort, Insertion Sort, Bubble Sort, and Binary Tree Sort. While, Quicksort, Heap Sort, and Selection Sort Are Unstable Sorting Algorithms. If You Remember, the Collections. Sort() Method from the Java Collection Framework Uses Iterative Merge Sort Which Is a Stable Algorithm.

What Is Stable Sorting Algorithm with Example?

Some Examples of Stable Algorithms Are Merge Sort, Insertion Sort, Bubble Sort and Binary Tree Sort. While, Quicksort, Heap Sort, and Selection Sort Are the Unstable Sorting Algorithm. If You Remember, Collections. Sort() Method from Java Collection Framework Uses Iterative Merge Sort Which Is a Stable Algorithm.

What Is Stable Property of an Algorithm?

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 Array to Be Sorted.

Which of the Algorithm Is Not Stable?

11. Which of the Following Is Not a Stable Sorting Algorithm? Explanation: out of the Given Options Quick Sort Is the Only Algorithm Which Is Not Stable. Merge Sort Is a Stable Sorting Algorithm.

Why Quick Sort Is Unstable?

Quicksort Is an Unstable Algorithm Because We Do Swapping of Elements According to Pivot's Position (Without Considering Their Original Positions).

Why Heap Sort Is Unstable?

Heap Sort Is Not Stable Because Operations in the Heap Can Change the Relative Order of Equivalent Keys. the Binary Heap Can Be Represented Using Array-Based Methods to Reduce Space and Memory Usage. Heap Sort Is an in-Place Algorithm, Where Inputs Are Overwritten Using No Extra Data Structures at Runtime.

Which of the Following Is an Example of an Unstable Sorting Algorithm?

Which of the Following Is an Example of an Unstable Sorting Algorithm? Explanation: out of the Given Options Only Cycle Sort Is an Unstable Sorting Algorithm. This Implies That the Relative Position of Equal Valued Elements in the Input and Sorted Array Does Not Remain the Same When We Use Cycle Sort.

What Is Stable and in Place Sorting?

Stable Means the Order of Input Elements Is Unchanged Except Where Change Is Required to Satisfy the Requirements. a Stable Sort Applied to a Sequence of Equal Elements Will Not Change Their Order. in-Place Means That the Input and Output Occupy the Same Memory Storage Space.

Is Bucket Sort Stable?

Bucket Sort Is Stable, If the Underlying Sort Is Also Stable, as Equal Keys Are Inserted in Order to Each Bucket. Counting Sort Works by Determining How Many Integers Are Behind Each Integer in the Input Array A.

Is Binary Insertion Sort Stable?

Explanation: out of the Given Options Binary Insertion Sort Is the Only Algorithm Which Is Stable. It Is Because the Elements with Identical Values Appear in the Same Order in the Output Array as They Were in the Input Array.

Which Is the Best Sorting Algorithm?

The Time Complexity of Quicksort Is O(N Log N) in the Best Case, O(N Log N) in the Average Case, and O(N^2) in the Worst Case. but Because It Has the Best Performance in the Average Case for Most Inputs, Quicksort Is Generally Considered the “Fastest” Sorting Algorithm.

Why Counting Sort Is Called Stable Sort?

Because of Its Application to Radix Sorting, Counting Sort Must Be a Stable Sort; That Is, If Two Elements Share the Same Key, Their Relative Order in the Output Array and Their Relative Order in the Input Array Should Match.

Why Stable Sorting Is Important?

A Stable Sorting Algorithm Maintains the Relative Order of the Items with Equal Sort Keys. an Unstable Sorting Algorithm Does Not. in Other Words, When a Collection Is Sorted with a Stable Sorting Algorithm, Items with the Same Sort Keys Preserve Their Order After the Collection Is Sorted.

What Does an Algorithm?

An Algorithm Is a Set of Instructions for Solving a Problem or Accomplishing a Task. One Common Example of an Algorithm Is a Recipe, Which Consists of Specific Instructions for Preparing a Dish or Meal.

Why Is Stability Important for Radix Sort?

It Is Very Important That Radix Sort Use a Stable Sort for Sorting on the Digit Values in Each Position. This Is Because Once an Element Has Been Assigned a Place According to the Digit Value in a Less Significant Position, Its Place Must Not Change Unless Sorting on One of the More Significant Digits Requires It.

Which Is Stable and but Not in-Place Sorting Algorithm?

Merge Sort Is a Stable Algorithm but Not an in-Place Algorithm. It Requires Extra Array Storage. Quicksort Is Not Stable but Is an in-Place Algorithm. Heap Sort Is an in-Place Algorithm but Is Not Stable.

What Is Stable or Unstable Algorithm?

By David Miller

• Oct 8, 2026 • 5 min read

Direct Answer • Key Takeaway

Stable Sorting Algorithms Preserve the Relative Order of Equal Elements, While Unstable Sorting Algorithms Don't. in Other Words, Stable Sorting Maintains the Position of Two Equals Elements Relative to One Another.

David Miller

Executive Financial & Market Analyst

David Miller brings 15 years of experience in global economics, personal finance strategy, and market dynamics. He specializes in turning complex economic trends into actionable insights for everyday readers.

Tags: what is stable or unstable algorithm