Micky Maguire
Mind Map by Micky Maguire, updated more than 1 year ago
Micky Maguire
Created by Micky Maguire over 4 years ago


Mind Map on Algorithms, created by Micky Maguire on 02/09/2017.

Resource summary

  1. Computational thinking
    1. Abstraction
      1. Using symbols and variables to represent a real world problem in a computer program removing unnecessary details
        1. E.g. Not having curved lines in tube maps so they are easier to read
          1. Sat nav - dont need houses/ hills/ etc
        2. Algorithmic thinking
          1. Solving a problem using defined instructions
            1. Example: psuedocode
          2. Decomposition
            1. Breaking down larger, complex problems into smaller sub-problems
              1. Example: a bike Explain how each part works instead of all at once. E.g. Say how brakes work and then wheels
          3. Search algorithms
            1. Linear search
              1. Goes through every item until item being searched for is found
              2. Binary search
                1. Goes to middle item
                  1. Looks at numbers on left and right and compares to item searched for
                    1. Gets rid of all numbers on side not needed
                      1. Repeats until item is found
                2. Sort algorithms
                  1. Bubble sort
                    1. Compare first 2 items and swap if needed
                      1. Once compared repeat with next 2 items
                        1. When whole row is done repeat until all items sorted
                      2. Slow
                        1. Easiest to code
                        2. Insert sort
                          1. Take item
                            1. Item is sorted Put all other items as unsorted
                              1. Compare first item in list and sort Once sorted place in order in sorted side
                                1. Take next item and compare with all items on sorted side then put in order
                                  1. Repeat until all numbers sorted
                            2. Easy to code
                              1. Faster than bubble sort
                              2. Slower than merge sort
                              3. Merge sort
                                1. Split all items into separate columns
                                  1. Compare and combine every pair of items
                                    1. Once combined the pair become one item
                                      1. Compare next items in pairs
                                        1. Repeat until all are one item in order
                                  2. Hard to code
                                    1. Can use others if less than 1000 items
                                    2. Quickest
                                Show full summary Hide full summary


                                Data Structures & Algorithms
                                Reuben Caruana
                                Computer science unit 2
                                Somto Ibeme
                                Algorithms ♡
                                lauren ♥
                                Computational Thinking ♡
                                lauren ♥
                                Searching and Sorting Algorithms
                                Josh Calvert
                                Systems Software Revision
                                Grafy I.
                                Michal Roch
                                Grafy I. - selftest
                                Michal Roch
                                Mathematical Preliminaries
                                OLL Algorithms
                                Preston Lloyd
                                Hash Functions