2.1-Algorithms

2.1-Algorithms

1. Abstraction

   • It is when you use variables to represent something real in a computer program
   • ....and to remove unnecessary things
   • Removing any unnecessary information and leaving only the relevant information.
   • Computational think which only focuses on what is important when problem solving
   • Satnav is an example, it only shows the route and roads but does not include the trees or fields

2. Computational thing

   • Solving problems with the use of computers
     • Development of algorithms to solve problems

3. 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.

4. Algorithmic Thinking

   • Solving a problem by identifying the steps

5. Linear search

   • Each item gets checked in order

6. Binary search

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

7. Bubble sort

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

8. Merge sort

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

9. Insertion sort

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