Heap sort

Heap sort use a heap to sort. Time complexity: O(NlogN). Space complexity: O(1). In place and unstable.

XXL

Merge sort

Merge sort is a divide and conquer algorithm. Time complexity: O(NlogN). Space complexity O(N). not in place and stable.

Small

Quick sorts use divide and conquer strategy without using extra space. Time complexity: O(NlogN), Space complexity: O(1gN). in place and unstable.

Large