COMP 2211 Sorting Algorithm

Is heap sort stable and/or in place?

Not Stable and In Place

Is quick sort sort stable and/or in place?

Not Stable and In Place

Is selection sort stable and/or in place?

Not Stable and In Place.

Is bubble sort stable and/or in place?

Stable and In Place.

Is insertion sort stable and/or in place?

Stable and In Place.

Is merge sort stable and/or in place?

Stable and Not In Place

Is radix sort stable and/or in place?

Stable and Not In Place

What does it mean for an algorithm to be stable?

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 unsorted array.

What does it mean for an algorithm to be in place?

This describes an sorting algorithm which transforms input using no additional data structure and constant O(1) space.