Algorithms

Algorithms

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
    2. Sat nav - dont need houses/ hills/ etc
2. Algorithmic thinking
  1. Solving a problem using defined instructions
    1. Example: psuedocode
3. 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
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
        Repeats until item is found
3. Sort algorithms
  1. Bubble sort
    1. Compare first 2 items and swap if needed
      1. Once compared repeat with next 2 items
        When whole row is done repeat until all items sorted
    2. Slow
    3. Easiest to code
  2. Insert sort
    1. Take item
      1. Item is sorted Put all other items as unsorted
        Compare first item in list and sort Once sorted place in order in sorted side
        Take next item and compare with all items on sorted side then put in order
        Repeat until all numbers sorted
    2. Easy to code
      1. Faster than bubble sort
    3. Slower than merge sort
  3. Merge sort
    1. Split all items into separate columns
      1. Compare and combine every pair of items
        Once combined the pair become one item
        Compare next items in pairs
        Repeat until all are one item in order
    2. Hard to code
      1. Can use others if less than 1000 items
    3. Quickest

Nächster

Beschreibung

Zusammenfassung der Ressource

ähnlicher Inhalt

	Erstellt von Micky Maguire vor fast 8 Jahre