exchange sort

Summary

exchange sort is a comparison sort^[1].

Key Facts

• exchange sort's instance of is recorded as comparison sort^[2].
• exchange sort's instance of is recorded as in-place algorithm^[3].
• exchange sort's instance of is recorded as stable sorting algorithm^[4].
• exchange sort's different from is recorded as bubble sort^[5].
• exchange sort's worst-case time complexity is recorded as O(n^2)^[6].
• exchange sort's worst-case space complexity is recorded as O(1)^[7].

Body

Designation and Status

Recorded instance of include comparison sort^[2], in-place algorithm^[3], and stable sorting algorithm^[4].