1. Lecture 5 Sorting

2. Overview

3. Mathematical Definition

4. Types of Sorting Algorithms

5. Permutation Sort

6. Cost of Sorting Algorithms

7. 2 Main Sorting Functions

8. Simple Sorts Insertion Bubble Selection

9. Insertion Sort: Example

11. Insertion Sort: Pseudocode

12. Insertion Sort: Analysis

13. Bubble Sort: Example

15. Bubble Sort: Pseudocode

16. Bubble Sort: Analysis

17. Bubble Sort Variants

18. Selection Sort: Example

20. Selection Sort: Pseudocode

21. Selection Sort: Analysis

22. Sort Stability

24. Mystery Sort

25. Shell Sort: example

27. Shell Sort: Pseudocode

28. Shell Sort: Analysis

29. Merge Sort: example

31. Merge Sort: Pseudocode

32. Merge Sort: Analysis

33. Quicksort: example

35. Quicksort: Pseudocode

36. Quicksort: Analysis

37. Counting sort: example

38. Counting Sort: example

39. Counting Sort : Pseudocode

40. Counting Sort : Analysis

41. Radix sort: example

42. Radix Sort: example

43. Radix Sort : Pseudocode

44. Radix Sort : Analysis

45. External Merge Sort: example

47. External Merge Sort : Pseudocode

48. External Merge Sort : Analysis