What are some examples of unstable sorting algorithms?

What are some examples of unstable sorting algorithms?

Unstable sorting algorithms are those that do not preserve the relative order of equal elements. Examples include Quick Sort, Heap Sort, and Selection Sort.

Can you explain why Quick Sort is considered unstable?

Quick Sort is considered unstable because, during the partitioning process, equal elements may be rearranged in a way that changes their original order.

Are there any stable alternatives to these algorithms?

Yes, stable sorting algorithms include Merge Sort, Bubble Sort, and Insertion Sort, which maintain the relative order of equal elements.

When would I choose an unstable sorting algorithm over a stable one?

You might choose an unstable sorting algorithm when performance is critical, and the relative order of equal elements is not important for your application.