Sorting Algorithms

发布时间：2020-12-14 04:38:06 所属栏目：大数据来源：网络整理

导读：Reference [1]?https://www.geeksforgeeks.org/stable-quicksort/ Stability A?sorting algorithm?is said to be?stable?if it maintains the relative order of records in the case of equality of keys. Some sorting algorithms are stable by nature li

Reference

[1]?https://www.geeksforgeeks.org/stable-quicksort/

Stability

A?sorting algorithm?is said to be?stable?if it maintains the relative order of records in the case of equality of keys.

Some sorting algorithms are stable by nature like?Insertion sort,?Merge Sort,?Bubble Sort,etc. And some sorting algorithms are not,like?Heap Sort,?Quick Sort,etc.
QuickSort is an unstable algorithm because we do swapping of elements according to pivot’s position (without considering their original positions).

If Swap is every expensive,better stability is expected.

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!