2.1 & 2.1.2

2.1 & 2.1.2

1. Computational Thinking

   • Allows us to solve complex problems and develop some possible solutions

2. Decomposition

   • Breaking down a complex problem or system into smaller, more manageable parts

3. Abstraction

   • Focusing on the important information only, ignoring irrelevant detail

4. Algorithms

   • Developing a step by step solution to the problem, or the rules to follow to solve the problem

5. Complex Problem

   • A complex problem is one that we don"t know how to easily solve at first glance

6. Binary Search

   • An ordered list is divided in 2, with each comparison
   • needs to be in order
     • take the middle value
       • compare to the value you're looking for
         • IF it is the value you're looking for
           • ELSE if its larger than the one you are looking for
             • take the values to the left of the middle
               • IF smaller, take the values to the right of the middle value
                 • Repeat the new list
   • only works if data is in order
   • longer and more complex to write

7. Linear Search

   • by chance, can be quicker
   • each item in the list is checked in order
   • check the first value
     • IF it is the value you're looking for
       • ELSE move to & check the next value
         • Repeat until you have checked all the elements and not found the value you are looking for
   • simpler to write