01-algorithms

# 01-algorithms - Introduction to Algorithms CSE 114:...

This preview shows pages 1–7. Sign up to view the full content.

Introduction to Algorithms CSE 114: Computer Science I 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
“Computer Science is no more about computers than astronomy is about telescopes.” — E. W. Dijkstra “Don’t sweat it — it’s only ones and zeros.” — P. Skelly 2
Algorithms • Algorithms are the heart of computer science • An algorithm is a description of the steps necessary to solve a problem • “problem” = “task to be performed” • A computer program embodies an algorithm 3

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Algorithm Attributes • An algorithm must be: • complete • precise • fnite • An algorithm should describe exactly how to perForm a given procedure 4
Developing an Algorithm • Start with the input and desired output • Divide and conquer the problem • Iterative refnement oF solution • Present your solution as pseudocode • When each solution step looks like a program statement, you’re done! 5

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Algorithm Building Blocks 1. Expressions 2. Conditional (selection) statements 3. Iteration (repetition) statements 4. Subprogram invocations Closely related to expressions 6
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 04/07/2008 for the course CSE 114 taught by Professor Tashbook during the Spring '08 term at SUNY Stony Brook.

### Page1 / 19

01-algorithms - Introduction to Algorithms CSE 114:...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online