Question

Prove that best case for bubble sort is worst case for heap sort

Answer 1

Answer:

Bubble sort has worst-case and average complexity both О(n²), where n is the number of items being sorted. ...

Even other О(n²) sorting algorithms, such as insertion sort, tend to have better performance than bubble sort. Therefore bubble sort is not a practical sorting algorithm when n is large

Answer 2

Hiiii dude.......

Bubble sort has worst-case and average complexity both О(n²), where n is the number of items being sorted.