2.1

2.1

1. binary search

   • needs to be in order
     • take the middle value
       • compare to the value you are looking for
         • else if its larger than the one you are looking for
           • take the values of the left to the middle
             • if smaller take the values to the right of the middle value
               • repeat the new list

2. linear search

   • check the first value
     • if it is the value you are looking for
       • else move and check the next value
         • repeat until you have checked all the elements and not find the value you are looking for
   • by chance can be quicker
   • simple to write
   • each item in the list is checked

3. decomposition

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

4. abstraction

   • focusing on the important information only , ignoring irrelevant detail

5. computational thinking

   • allows us to solve complex and develop some possible solutions

6. complex sentences

   • a complex problem that we don't know how to easily solve at first glance