2.1 Algorithms

2.1 Algorithms

1. Computational thinking

   • abstraction
     • using symbols and variables to represent "real world" problems
     • getting rid of irrelevant Information and focusing on important information
   • decomposition
     • big problems to smaller problems
       • easier to solve
     • problems can be decomposed
     • independent of others
   • algorithmic thinking
     • identifying steps in solving problems

2. Types of sorting

   • bubble
     • goes though list repeatedly swapping elements until in correct order
   • Insertion
     • each item is taken in turn compared to an ordered list. It is placed in correct position
   • merge
     • a list split into individual lists,these are then combined

3. Linear search

   • simple writing
     • no need to be in order
   • goes through one by one
   • IF correct, stop
   • ELSE carry on to next value

4. flowchart

   • input/output data
   • processes
   • decisions
   • shapes rep functions
   • lines show flow control

5. pseudocode

   • "fake" code
   • partway between sentences and coding

6. binary search

   • take middle value
   • longer, more complex
   • if correct then stop
   • ELSEIF it is larger, take values on the left
   • compare to required value
   • IF smaller, take values to the right
   • list needs to be in order

7. Flowchart

   • input/ output data
   • processes
   • decisions
   • shapes rep functions
   • lines show flow control

8. dry run

   • trace table
   • walking through and running each step manually
   • table that follows the values f variables to check for accuracy