Home > Lectures > Selection Sort

Selection Sort

By Julie Zelenski - Stanford
get flash player

Lecture Description

Selection Sort, Live Demo: Working/execution of the Code, Selection Sort Analysis, Insertion Sort Algorithm, Live Demo: Working/execution of Insertion Sort, Insertion Sort Analysis, Insertion vs Selection, Quadratic Growth of the Algorithm, Merge Sort, Merge Sort: Working/execution Demo, Merge Sort Code Explanation, Merge Sort Analysis, Quadratic vs Linear Arithmetic, Sort 'Race', Quick Sort Idea

Course Description

Related Resources

Transcript

Course Index

  1. About the Introduction to Computer Science Series at Stanford
  2. Similarity between C++ & Java: - syntax - variable types - operators - control structures
  3. C++ Libraries - Standard Libraries
  4. C++ Console I/O
  5. Client Use of Templates
  6. More Containers
  7. Seeing Functions as Data: Specific Plot Functions
  8. Common Mistakes Stumbled Upon: 'I'terator
  9. Thinking Recursively
  10. Refresh: Permute Code
  11. Backtracking Pseudocode
  12. Pointer Movie
  13. Coding with Linked List
  14. Selection Sort
  15. Partitioning for Quicksort
  16. Sort Template with Callback
  17. Abstract Data Types
  18. Rules of Template Implementation
  19. Live Coding: Recap of the Vector-based Implementation for Stack
  20. Buffer: Vector vs Stack
  21. Map as Vector
  22. Pathfinder Demo
  23. Compare Map Implementations
  24. Lexicon Case Study
  25. Final Showdown
  26. About the C++ Language, Quick History of C++, C++ Philosophy