Sorting algorithms — true or false?

Exercise and reference answers

Questions

1. Statement is true

   Yes

   Statement

   Merge Sort is a stable sort.

2. Statement is true

   Yes

   Statement

   Quick Sort has O(n²) worst-case time complexity.

3. Statement is true

   Yes

   Statement

   Heap Sort is an in-place sort with O(n log n) time.

4. Statement is true

   No

   Statement

   Counting Sort can sort floating-point numbers in O(n) time.