An Algorithmic and Social Introduction to Computer Science (CSC-105 2000S)


Class 08: The Parts of an Algorithm

Back to The Building Blocks of Computer Programs. On to Analyzing Algorithms.

Held Friday, February 4, 2000

Overview

Today's outline does not yet have an overview. Please let me know if you think it should have one.

Question 8 for today's class: Describe unambiguously how to find the lowest grade in a list of grades.

Question 9 for Monday's class: Suppose you've been given two sets of instructions that solve the same problem. What criteria might you use to determine whether one is better than the other?

Notes

Contents

Summary


Algorithm Basics

Variables

Conditional

Repetition

Some Exercises

Getting Started

An Algorithm

Reflections

Finding the smallest numeric grade in a list


History

Saturday, 22 January 2000

Friday, 4 February 2000

Back to The Building Blocks of Computer Programs. On to Analyzing Algorithms.


Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at http://www.math.grin.edu/~rebelsky/Courses/CS105/2000S/Outlines/outline.08.html

Source text last modified Fri Feb 4 09:50:16 2000.

This page generated on Fri Feb 4 09:48:50 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu