Algorithms

Before designing an algorithm it is important to first understand what the problem is. Algorithms can be designed using pseudocode or a flowchart, and the standard notations of each should be known.

Searching for data can be very difficult. Searching algorithms, such as linear search (also known as serial search) and binary search, make the process of searching for data much easier.

Putting data into order can be difficult and time consuming. Sorting algorithms, such as bubble sort and bucket sort can help with this.

When designing algorithms, it is important to make sure that all the steps are presented in the correct order. This is known as sequencing, and can be displayed in pseudocode or flowcharts.

When designing algorithms, there are many steps where decisions must be made. This decision is known as selection, and can be displayed in pseudocode or flowcharts.

When designing algorithms, there may be some steps that need repeating. This is known as iteration, and can be displayed in pseudocode or flowcharts.

There is almost always more than one solution to a problem. Logical reasoning is used to predict the outcomes of the algorithms that are designed to solve a problem, to help select the best solution.