This document discusses the analysis of insertion sort and merge sort algorithms. It covers the worst-case and average-case analysis of insertion sort. For merge sort, it describes the divide-and-conquer technique, the merge sort algorithm including recursive calls, how it works to merge elements, and analyzes merge sort through constructing a recursion tree to prove its runtime is O(n log n).

1. Insertion Sort Analysis
Dr.AMIT KUMAR @JUET

2. The problem of sorting
Dr.AMIT KUMAR @JUET

3. Insertion Sort
Dr.AMIT KUMAR @JUET

4. Insertion Sort Example
Dr.AMIT KUMAR @JUET

5. Analysis of Insertion sort
Dr.AMIT KUMAR @JUET

6. Analysis of Insertion sort
Dr.AMIT KUMAR @JUET

7. Analysis of Insertion sort
Dr.AMIT KUMAR @JUET

8. Worst-case and Average-case
Analysis
Dr.AMIT KUMAR @JUET

9. Order of Growth
Dr.AMIT KUMAR @JUET

10. Designing Algorithms
Dr.AMIT KUMAR @JUET

11. Divide and Conquer Sorting
Technique Analysis
Dr.AMIT KUMAR @JUET

12. Divide-and-Conquer
Dr.AMIT KUMAR @JUET

13. Merge Sort Algorithm
Dr.AMIT KUMAR @JUET

14. Merge-Sort (A, p, r)
Dr.AMIT KUMAR @JUET

15. Dr.AMIT KUMAR @JUET

16. Action of Merge Sort
Dr.AMIT KUMAR @JUET

17. Analysis divide-and-conquer
algorithms
Dr.AMIT KUMAR @JUET

18. Mergesort Analysis
Dr.AMIT KUMAR @JUET

19. Proof by Picture of Recursion Tree
Dr.AMIT KUMAR @JUET

20. Construction of recursion tree
Dr.AMIT KUMAR @JUET

21. Dr.AMIT KUMAR @JUET