Algorithms - 2.1

Algorithms - 2.1

1. ABSTRACTION: (1)using symbols to represent a real world problem in a computer program. (2) also by removing unnecessary elements.

2. COMPUTATIONAL THINKING: the use of computers to solve problems.

3. DECOMPOSITION: breaking down a large problem into smaller sub-problems.

4. ALGORITHMIC THINKING: identifying the steps involved in solving a problem.

5. LINEAR SEARCH: each item in the list is checked in order BINARY SEARCH: list needs to be in order

6. BUBBLE SORT: moving through a list repeatedly, swapping elements that are in the wrong order MERGE SORT: a list is split into individual lists ,these are then combined(two lists at a time) LIST: a set of data

7. INSERTION CODE: each item is taken in turn, compered to the items in a sorted list and placed in the correct position

8. ORDERED LIST: elements are arranged in sequence

9. UNORDERED LIST: unarranged elements

10. ALGORITHM: the series of steps to solve a problem or perform an action

11. FLOWCHART: a diagram that shows the inputs, outputs and processes in an algorithm

12. PROCESS: an action that takes place

13. PSEUDOCODE: simplified programming code that is not language specific

14. DRY RUN: walking through an algorithm which samples data, running each step manually

15. TRACE TABLE: a table that follows the values of variables to check for accuracy