1. Chapter 5 Algorithms (1) Introduction to CS 1 st Semester, 2012 Sanghyun Park

2. Outline  Informal Definition of an Algorithm  FindLargest  Three Basic Constructs  Sorting Algorithms  Searching Algorithms  Recursion  Algorithm Performance(next file)  Time Complexity(next file)  Asymptotic Notation(next file)  Growth Rate(next file)

3. Informal Definition of Algorithm Used in Computer

4. Finding the Largest Number Among Five Integers

5. Defining Actions in FindLargest Algorithm

6. FindLargest Refined

7. Generalization of FindLargest

8. Three Basic Constructs

9. Flowcharts for Three Constructs

10. Pseudocode for Three Constructs

11. Concept of Subalgorithm

12. Summation

13. Product

14. Selection Sort

15. Example of Selection Sort (1/2)

16. Example of Selection Sort (2/2)

17. Selection Sort Algorithm

18. Bubble Sort

19. Example of Bubble Sort (1/2)

20. Example of Bubble Sort (2/2)

21. Insertion Sort

22. Example of Insertion Sort (1/2)

23. Example of Insertion Sort (2/2)

24. Search Concept

25. Example of Sequential Search (1/2)

26. Example of Sequential Search (2/2)

27. Sequential Search Algorithm When List is Sorted

28. Example of Binary Search

29. Binary Search Algorithm

30. Iterative Definition of Factorial

31. Recursive Definition of Factorial

32. Tracing Recursive Solution to Factorial Problem