What is the best for certain scenario of each of these?

selection sort

Worst complexity: O$($n$^2)$

Best complexity: O$($n$^2)$

Average complexity: O$($n$^2)$

Bubble sort

Worst complexity: O$($n$^2)$

Best complexity: O$($n$)$

Average complexity: O$($n$^2)$

Insertion sort

Worst complexity: O$($n$^2)$

Best complexity: O$($n$)$

Average complexity: O$($n$^2)$

Merge sort

Worst complexity: O$($n log n$)$

Best complexity: O$($n log n$)$

Average complexity: O$($n log n$)$

Quick sort

Worst$-$computed quantity: O$($n$^2)$

Best calculated quantity: O$($n log n$)$

Average complexity: O$($n log n$)$

Heap sort

Worst complexity: O$($n log n$)$

Best complexity: O$($n log n$)$

Average complexity: O$($n log n$)$