2.1:algorithms

2.1:algorithms

1. 'step by step solution to a problem'

   • not much detail but detailed enough
     • focus on the relavent information that needs to be fixed
   • planning the values to follow to solve the problem
     • these can be produced as codes and can be used for other users for the same problem

2. binary search

   • repeatedly dividing search interval in half
   • has to be in order
     • take the middle value
       • if it is larger then the one needed take the values to the left of the middle value
       • if it is smaller than the one needed take the values on the right of the middle value
       • however if it is the value you have been searching for then no worries you have found it so there is nothing else to do
         • takes longer

3. linear search

   • searches each element in list until a match is found
   • does not have to be in order
     • it is done by starting with the first value and checking every value until the value needed appears
     • is quicker

4. last step to solving a problem

5. part of computational thinking

6. algorithmic thinking

   • identifying the steps involved in solving a problem

7. bubble sort

   • moving through a list and swapping values that are in the wrong order and putting them in the correct order
     • E.G. 19452 changes into 12459
   • order of size

8. merge sort

   • a list split into to 2 individual lists
     • E.G. 12345678910 is a list, it is then split up into 12345 and 678910
   • can take a long time
   • is swapped into order

9. These are all methods of algorithmic thinking to solve a problem in different ways