This repository has been archived by the owner on Feb 17, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Algorithms (AP)
Scott Kowalczewski edited this page Sep 5, 2019
·
20 revisions
An algorithm is a set of instructions used to solve a problem. You use algorithms every day, for example:
Getting Ready for School
1. Wake Up
2. Eat Breakfast
3. Brush Teeth
4. Get Dressed
etc
Algorithms can be expressed in plain language (like above), flow charts (later!) or pseudocode (code intended to be read by humans and not computers).
There are three main components of algorithms:
Sequencing
This refers to the fact that the steps need to be completed in that order (top to bottom). It wouldn't make sense to Brush Teeth
before Wake Up
.
Selection
Perhaps something should only happen IF a condition is met. For example:
Getting Ready for School
1. Wake Up
2. I am hungry:
Eat Breakfast
2. Eat Breakfast
- Course Outline (ICS 2O0)
- Course Outline (AP)
- Overarching Learning Goals
- Due Dates and Submission Details
- AP Registration and Exam Information
- Hardware, Networking and Operating Systems - Research and Report
- Hardware, Networking and Operating Systems - Applying your Knowledge
- Algorithms (AP)
- Exercises (Set A)
- Exercises (Set B)
- Abstractions (AP)
- Processing - Assignment 1
- Processing - Assignment 2