Introduction

Sorting is an example of an algorithm, though the sort shown above is not the most efficient.

The understanding of algorithms is one of the key differences between a good programmer and a bad one. The use of proper algorithms, and the knowledge on how to build one, leads to efficient and sturdy programs. In this course, students will become familiar with these ideas and develop good programming techniques.

Due to the open nature of Wikiversity you are free to browse through these courses at whatever pace you desire. However, before you begin this course you should consider reviewing the material covered in the prerequisite courses (listed below) to ensure that you are prepared to learn this content.

In each lesson there is an objective at the top of the page, review these points and keep them in mind as you go through the lesson. At the end there is an assignment to test your understanding and further explain the material. Once you have finished the entire course you may move on to another course in the unofficial degree.

(Note: Many of these lessons are stubs, and they need a lot of help. Please excuse the mess - and help out if you can!).

Prerequisites

Prerequisites are courses it is suggested you understand before you attempt this course. If you're having a hard time understanding the material in this course, make sure you understand these prerequisites first.

• Introduction to Programming

Lessons

1. What is an algorithm?
2. Subalgorithms
3. Variables
4. Efficiency
5. Flow Control
6. Common Algorithms

Active Participants