Answer : Option(C)
- Selection sort
- Merge sort
- Insertion sort
- Heap sort
$$\begin{array}{|c|c|c|} \hline (1) & \text{Selection sort} & \text{Best-case performance} & O(n^{2}) \\ \hline (2) & \text{Merge sort} & \text{Best-case performance} & O(n\:log\:n) \\ \hline(3) & \text{Insertion sort} & \text{Best-case performance} & O(n) \\ \hline (4) & \text{Heap sort} & \text{Best-case performance} & O(n\:log\:n)\\ \hline \end{array}$$