An algorith is a set of instructions that describes how to slove a problem. They can be designed using flowcharts or pseudocode.
Decomposition is breaking a problem down into smaller, more managable chunks.
Abstraction is the process of removing smaller details from a problem so more importnat details can be focused on.
Pseudo-code is a simple way of describing a set of instructions in a manner that resembles a programming language.
. Inputs
. processes
. outputs
A flowchart is a diagram that shows an overview of an algorithm. Flowcharts use a variety of standard symbols to represent different elements, and arrows to show the flow or direction.
l programs need data to be added to or removed from code. Data entered into a program, either by the programmer or digitally, are referred to as inputs. These inputs are stored in variables and used to run the program.
n order to keep the user informed about what is happening inside the program, a programmer may choose to include outputs
Trace tables enable the variable values in an algorithm to be recorded as the algorithm is dry run. For example, using the times table algorithm below, a table could be created showing the value of the variables num and number as the program runs:
Efficiency looks at how much time it takes to run a particular algorithm and how much space is needed.