How to Find Algorithms
An algorithm is a set of rules or a process that typically describes how to do something or how to solve a problem. Algorithms are used in mathematics and in everyday life. If you describe to another person how to mow the lawn, this is an algorithm, because the person is following the steps to complete the task. These are also used in computer science when programmers instruct a computer to complete a process or task. Algorithms can be complex and there are ways to find algorithms and break them down to organize them.
Other People Are Reading
Instructions
-
-
1
Divide the algorithm up into smaller sections, which are often referred to as modules. For example, you may be given instructions for painting your house in two parts: one is how to prepare the walls for painting and the other section may be how to paint the walls. The algorithm is easier to understand if you look at one part at a time, rather than the whole process at once.
-
2
Single out any sections or steps in the algorithm that repeat more than once and give them a name. Call the step by the name you have given it when you are completing the steps. This step will become a module of the algorithm.
-
-
3
Notice any conditional paths. For short algorithms, list the steps in the order they should be completed. If the algorithm is more complex, module and functions are introduced and the paths come together. For example, if "A" happens, then "B" happens, then "C" happens.
-
1
Tips & Warnings
In algorithms, a module is usually short enough to write on a single page or type on a computer screen. If you are making an algorithm, work through it and check every module to make sure it can be completed. If the module is not verified, it should be removed.
Sometimes more than one course of action can be taken in an algorithm.
