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