Unit 2.1 Algorithms

Unit 2.1 Algorithms

1. Abstraction

   • Using symbols/variables

2. Decomposition

   • Breaking down large problems into smaller, easier to solve problems

3. Algorithmic Thinking

   • Identifying the steps involved in solving a problem

4. Linear Research

   • Each item in the list is checked in order

5. Computational Thinking

   • Use of computers to solve problems

6. Binary Research

   • An ordered list is divided in 2 with each comparison

7. Bubble Sort

   • Moving through a list repeatedly; swapping elements that are in wrong order

8. Merge Sort

   • A list is split into indivudual lists; then combined (2 lists at a time)

9. Insertion Sort

   • Each items is taken in turns to be placed in the correct position

10. Ordered List

    • Elements are arranged in sequence

11. Unordered List

    • Unarranged elements

12. Algorithm

    • Series of steps to solve a problem

13. Flowchart

    • Diagram that shows inputs/outputs

14. Process

    • An action that takes place

15. Pseudocode

    • Simplified programming code that is not language specific

16. Dry Run

    • Sample data running each step manually

17. Trace Table

    • Table that follows the values of variables to check for accuracy