This document discusses sorting algorithms and analyzing algorithm performance. It covers insertion sort, analyzing what affects an algorithm's running time like input size, and finding the growth rate as input size changes. Examples are given of different loop structures like nested loops and how to analyze their effects on running time. Attendees are asked if they have any questions.

1. Week 2

2. Algorithms

6. Sorting algorithms

7. Insertion sort

12. Analyzing algorithms

13. https://www.youtube.com/watch?v=koMpGeZpu4Q

14. Analyzing algorithms
• You should know exactly what is the input size
• Algorithm analysis is to predict its performance
• The running time of an algorithm is the num of
primitive operations to be executed
• Our goal is to find the effect of changing input
size on the execution time (growth rate)

15. Apply on the insertion sort

16. Break

17. Examples
• loop
• nested loop
• nested loop from i
• nested loop (constant inner)
• two loops one after another

18. Any Questions ??

21. Thanks