2.1 - Algorithms

Description

Mind Map on 2.1 - Algorithms, created by Sam Haynes on 02/01/2019.
Sam Haynes
Mind Map by Sam Haynes, updated more than 1 year ago
Sam Haynes
Created by Sam Haynes over 5 years ago
22
0

Resource summary

2.1 - Algorithms
  1. Types of sorts
    1. Insertion
      1. You have one ordered list and a selection of other elements.
        1. Take one element at a time and compare it to the ordered list, and place in correct position.
          1. REPEAT
          2. Bubble
            1. Moving through a list repeatedly, swapping elements that are in the wrong order. Can take a long time to do.
              1. Take first 2 elements and compare.
                1. Put in order and compare the second with the third.
                  1. REPEAT until all of the list is checked with no changes.
                  2. Merge
                    1. Option A
                      1. Option B
                    2. Flowchart Symbols
                      1. Keywords
                        1. Flowchart
                          1. A diagram showing inputs, outputs and processes in algorithms.
                          2. Pseudocode
                            1. Simplified programming code that isn't programming language specific that is used to design algorithms.
                            2. Algorithms
                              1. A series of steps to solve a problem or perform an action.
                              2. Dry Run
                                1. Walking through an algorithm which samples data, running each step manually.
                                2. Trace Table
                                  1. A table that follows the values of variables to check for accuracy.
                                  2. Abstraction
                                    1. Getting rid of irrelevant detail and only focusing on the important elements.
                                    2. Pattern recognition
                                      1. Where you see where you can copy and paste similar code to save time and debugging.
                                    3. Completing and Correcting algorithms
                                      1. Correcting
                                        1. Ensure you know what the algorithm should do.
                                          1. Separate into smaller chunks and draft the steps that should occur.
                                            1. Read through the algorithm and compare to your notes and correct the algorithm where they differ.
                                            2. Completing
                                              1. May be asked to fill in elements or just continue the algorithm.
                                                1. Follow the same steps as correcting, but complete at the end, rather than correct.
                                              2. Linear & Binary Search
                                                1. Does it need to be ordered?
                                                  1. BINARY: Yes
                                                    1. LINEAR: No
                                                    2. Long search?
                                                      1. BINARY: At worst, half of values are checked.
                                                        1. LINEAR: All values may have to be checked.
                                                        2. Complex?
                                                          1. BINARY: Longer and more complex to write.
                                                            1. LINEAR: Simpler to write.
                                                          Show full summary Hide full summary

                                                          Similar

                                                          Edexcel Additional Science Biology Topic 1
                                                          hchen8nrd
                                                          Plant and animal cells
                                                          Tyra Peters
                                                          Japanese Hiragana
                                                          pangcaberte
                                                          Macbeth Essay Notes
                                                          Mel M
                                                          A-LEVEL ENGLISH LANGUAGE : Key Theorists
                                                          Eleanor H
                                                          Performance y Planificación de Vuelo
                                                          Adriana Forero
                                                          Tips for Succeeding on the Day of the Exam
                                                          Jonathan Moore
                                                          2PR101 1. test - 5. část
                                                          Nikola Truong
                                                          Repaso Revalida PR 2016
                                                          Rodrigo Lopez
                                                          Core 1.5 Mechanisms
                                                          T Andrews