python programing

python programing

5.For problem size n, algorithms A and B perform n2 and n2 + n instructions, respectively. Which algorithm does more work? Are there particular problem sizes for which one algorithm performs significantly better than the other? Are there particular problem sizes for which both algorithms perform approximately the same amount of work?

6.Explain why the modified bubble sort still exhibits O(n2) behavior on the average.

7.Explain why insertion sort works well on partially sorted lists.

8.Describe the strategy of quicksort and explain why it can reduce the time complexity of sorting from O(n2) to O(n log n).