Introduces searching and sorting through linear search, then motivates algorithmic efficiency by examining how the amount of work grows with the data set.
Save to open this file
Stanford CS106A: Programming Methodology
All
01-Welcome to CS106A
- 01-Welcome to CS106A
- 02-Handout Information
- 03-Karel and Java
- 04-The History of Computing
- 05-Variables
- 06-readInt() and readDouble()
- 07-The Loop and a Half Problem
- 08-Information Hiding
- 09-Strings
- 10-Importance of Private Variables
- 11-The GImage Class
- 12-Enumeration
- 13-String Processing
- 14-Memory
- 15-Pointer Recap
- 16-Array
- 17-Multi-dimensional Arrays
- 18-A Wrap Up of Multi-dimensional Arrays
- 19-An Interface
- 20-GUI
- 21-Review of Interactors and Listeners
- 22-Overview of NameSurfer - The Next Assignment
- 23-Introduction to Lecture's material - Searching
- 24-Principles of Good Software Engineering for Managing Large Amounts of Data
- 25-Defining a Social Network for Our Purposes
- 26-Introduction to the Standard Java Libraries
- 27-Life After CS106A
- 28-The Graphics Contest Winners