retagged by
258 views

1 Answer

Best answer
3 votes
3 votes

Answer : Option(C)

  1. Selection sort
    Selection sort
    Best-case performance
    O(n2)
  2. Merge sort
    Merge sort
    Best-case performance
    O(nlog(n))
  3. Insertion sort 
    Insertion sort
    Best-case performance
    O(n)
  4. Heap sort
    Heap sort
    Best-case performance
    O(nlog(n))

  $$\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}$$ 

edited by
Answer:

Related questions