Question

Match the following sorting techniques with their camplees

a Best case Selection Sort

b. Best case Insertion Sort c insertion in heap sort

d. Worst case Heap-sort

1 On)

2. O(n 2)

3 Pin Login)

4 Login​

Answer 1

Answer:

sorry................

Answer 2

Explanation:

worst case O(n^2)

best case selection sort On

best case insertion logn