2.1 Algorithms

2.1 Algorithms

1. Linear and binary searches

   • Binary needs to be ordered
   • Linear doesn't need to be ordered
   • Linear is simpler to write
     • Through a long search all values will have to be checked-Linear
   • Binary is complex to write
     • Through long search half of the values are checked at it's worst

2. Sorts

   • Insertion
     • repeat
     • You have one ordered list and other elements
       • Take only one element and compare it to the ordered list and put it into the correct position
   • Bubble
     • Decoding through instructions repeatedly, swapping elements that are in the wrong order to the right order
       • Take first 2 elements to compare
         • Put the in order and compare with the 2nd and 3rd
           • Then repeat until the list is changed with no errors or changes

3. Keywords

   • Trace Table- A table that follows the values of variables to check for accuracy
     • Pattern Recognition-a branch of machine learning that focuses on the recognition of patterns and regularities in data
       • Abstraction- Getting rid of irrelevant details and only focusing on the important bits
         • Dry Run- Walking through an algorithm which samples data whilst running each step manually
           • Flowchart-A diagram showing inputs, outputs and the processes in algorithms
             • Algorithms-A series of instructions/steps to solve a problem or perform an action
               • Pseudocode-Used to design algorithms, it's a simplified programming code that isn't specific programming language
                 • Merge-List split into two and combined two at time

4. Computational thinking

   • Algorithmic Thinking
     • Identifying the steps involved to solve a problem
   • 4 parts
     • Abstraction
     • Decomposition
     • Algorithms
     • Pattern Recognition

5. Completing and Correcting Algorithms

   • Completing
     • Ensure you know what the algorithm should do
       • Separate into smaller chunks then make the other steps that should occur
         • Finally read through the algorithm and complete it