You are here

Thinking about Algorithms

Author: 
Goldman, Kenneth J
Issue Date: 
Monday, June 25, 2007
Description: 
Introduces the idea of an algorithm through discussing interesting problems in computer science. These problems include the Stable Marriage problem, finding square roots, finding the greatest common divisor (GCD), and the halting problem.
Keywords: 
algorithm, stable marriage, square root, root finding, GCD, halting problem
Education Levels: 
Middle School
High School
Intended Audience: 
Educator
Learner
Type: 
Instructional Material : Lecture/Presentation
Publisher: 
TECS Workshop: Washington University Department of Computer Science and Engineering Professional Development Workshop
URL: 
http://hdl.handle.net/2378/232
CSTA Classification: 

CT.L3B-01

Classify problems as tractable, intractable, or computationally unsolvable.

CT.L3A-02

Describe a software development process used to solve software problems (e.g., design, coding, testing, verification).

CT.L2-01

Use the basic steps in algorithmic problem-solving to design solutions (e.g., problem statement and exploration, examination of sample instances, design, implementing a solution, testing, evaluation).

Download this resource: