2.1

2.1

1. computational thinking - the use of computers to solve problems

2. abstraction - representing 'real world' problems in a computer using variables and symbols and removing unnecessary elements from the problem.

3. decomposition - breaking down a large problem into smaller sub-problems.smaller problems are easier to solve. they can be created independent of the other problems. they can be tested independently. then combined to produce the full problem.

4. algorithmic thinking identifying the steps involved in solving a problem.

5. linear search - each item in the list is checked in order.

   • the binary search only works if the data is in order.
   • how to search if its not in order : check the first value. if it isnt move to and check the next value. repeat until you have checked all the elements and not found the value you are looking for.

6. binary search - an ordered list is divided in 2 with each comparison

   • the list needs to be in order.
   • take the middle value.
   • compare to the value you are looking for.

7. bubble sort - moving through a list repeatedly, swapping elements that are in the wrong order.

   • take the first element and second element from the list.
   • compare them.
   • if element 1 > element 2 then - swap then
   • else do nothing.
   • repeat move along the list to the next pair.

8. merge sort - a list is split into individual lists, these are then combined.

   • split all the elements into individual lists.
   • compare the first

9. list - a set of data