2.1 - Algorithms

2.1 - Algorithms

1. Keywords

   • Flowchart
     • A diagram showing inputs, outputs and processes in algorithms.
   • Pseudocode
     • Simplified programming code that isn't programming language specific that is used to design algorithms.
   • Algorithms
     • A series of steps to solve a problem or perform an action.
   • Dry Run
     • Walking through an algorithm which samples data, running each step manually.
   • Trace Table
     • A table that follows the values of variables to check for accuracy.
   • Abstraction
     • Getting rid of irrelevant detail and only focusing on the important elements.
   • Pattern recognition
     • Where you see where you can copy and paste similar code to save time and debugging.

2. Linear & Binary Search

   • Does it need to be ordered?
     • BINARY: Yes
     • LINEAR: No
   • Long search?
     • BINARY: At worst, half of values are checked.
     • LINEAR: All values may have to be checked.
   • Complex?
     • BINARY: Longer and more complex to write.
     • LINEAR: Simpler to write.

3. computational thinking

   • Using computers to solve complex questions
     • Decomposition
       • involves breaking down a complex problem or system into smaller parts that are more manageable and easier to understand.