sort and stability

Question

I would like to know why merge sort is stable and quick sort is not. I know if the relative order is preserved all the time then it's stable.

shouldn't merge sort still do tie breaking? will it be still stable when it doesn't do tie breaking?

I understand quick sort will be unstable if it doesn't do tie breaking.

can u give me some examples? thank you

a quick internet search will answer that.... try wiki – Mitch Wheat Nov 15 '11 at 01:31 — Mitch Wheat, Nov 15 '11 at 01:31

score 0 · Answer 1 · edited May 23 '17 at 10:24

0

Looks like Stack already has the answer covered in a different thread

edited May 23 '17 at 10:24

Community

answered Nov 15 '11 at 01:59

1 Answers1