Easy Sorting Question 60 of 224

What does it mean for a sorting algorithm to be stable, and why does it matter?

DSA interview set · Speak this in 60–90 seconds · Faridabad & Delhi NCR

PICTURE THIS: GIT FLOW

Working folderYour files

Staginggit add

Local repogit commit

Remotegit push

Simple meaning

Stable sorts keep equal keys in their original relative order.

WHY — Sorting instead of guessing?

Why interviewers care about Sorting:

Sorting questions separate people

who only read docs from people who shipped.

Keep it short, concrete,

and tied to DSA work.

Stay structured

Name the idea, why it exists, then one short example.

Close cleanly

End with when you use it and one common pitfall.

STEPS — What happens step by step?

Before you speak the answer, walk the interviewer through these steps:

1
Stable sorts keep equal
keys in their original relative order.
2
That matters when you
sort by one field and then another, like sorting employees by name then by department.
3
Merge sort and insertion
sort are stable
4
naive heapsort and many
in-place quicksorts are not.
5
Common mistake
What juniors usually get wrong.
6
Close
When you pick this over the alternative.

EXAMPLE — See it in action

Here's a short line you can speak, broken into clear beats:

Say this line

“That matters when you sort by one field and then another, like sorting employees”

Break into beats

Thatmatterswhenyousortby

Speaking order

2987408337471632900

Note: Adapt this scaffold to your own project — keep it under 60–90 seconds.

Key takeaway

Stable sorts keep equal keys in their original relative order. That matters when you sort by one field and then another, like sorting employees by name then by department.