Sorting Algorithms

Question 1

Which sorting algorithms are stable

Answer 1

Merge Sort, Insertion Sort, Counting Sort (basic forms)

Question 2

Which sort is the best for nearly-sorted data

Answer 2

insertion sort

Question 3

What is the worst-case complexity for Quick sort

Answer 3

O(n²), if the pivot is always the worst element.

Question 4

What does it mean if a sort is stable

Answer 4

it preserves the relative order of equal elements