2.1 algorithmes

2.1 algorithmes

1. Abstraction

   • It is when you use variables to represent something real in a computer program
     • Removing any unnecessary information and leaving only the relevant information.
   • Computational think which only focuses on what is important when problem solving

2. Decomposition

   • Breaking down a large problem into small sub-problems
     • the sub-problems become easier
     • They can be tested independently
     • All sub-problems are joined back together to produce the full problem
     • Have more than one person work on this big problem.

3. Algorithmic Thinking

   • Solving a problem by identifying the steps

4. Linear search

   • Each item gets checked in order

5. Binary search

   • An ordered list divided into 2 with each comparison
   • Only works with an ordered list

6. Bubble sort

   • Moving through a list and putting them in order as you go along.

7. Merge sort

   • a list that is split and then combined-preferably 2 lists at a time

8. Insertion sort

   • Each number is compared by each other number and placed in the correct place