2.1 - Algorithms

Descripción

Mapa Mental sobre 2.1 - Algorithms, creado por Sam Haynes el 02/01/2019.
Sam Haynes
Mapa Mental por Sam Haynes, actualizado hace más de 1 año
Sam Haynes
Creado por Sam Haynes hace más de 6 años
25
0
1 2 3 4 5 (0)

Resumen del Recurso

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.
                                                          Mostrar resumen completo Ocultar resumen completo

                                                          0 comentarios

                                                          There are no comments, be the first and leave one below:

                                                          Similar

                                                          Fichas de Inglés - Vocabulario Intermedio
                                                          maya velasquez
                                                          test de Sociología
                                                          pedro zambrano olivares
                                                          Criterios generales de evaluación de la Selectividad: Comentarios de Texto
                                                          maya velasquez
                                                          ¿A qué tiempo y modo corresponde?
                                                          Remei Gomez Gracia
                                                          Los agentes de la economía
                                                          María Eugenia Méndez Piamba
                                                          TEST DE ANATOMIA (HUESOS)
                                                          patotigre199
                                                          Proceso de la investigación científica
                                                          Alejandra Cortes
                                                          Habilidades del Pensamiento
                                                          Kimm Fdez
                                                          Test Ley 39/2015 Procedimiento Administrativo Común de las AAPP
                                                          Juan Carlos Gómez
                                                          Test Estructuras I: Introducción a las estructuras
                                                          Pedro Landín