Mindmap
Bubble sort
Inhalt der Mindmap
Bubble sort
Pros
- Simple algorithm that can easily implemented on any computer
- doesn't use much memory
- Efficient way to check if a list is already in order
Cons
- Inefficient way to sort a long list with the worst case scenario
- doesn't cope well with a very large list of items
How it works
- Compares pairs of items
- If the items are in the wrong order it swaps them
- Multiple passes are executed until the list is in order
- If the items are in the wrong order it swaps them
- Compares pairs of items
Informationen
- Beschreibung
- Year 10 Computing Mindmap am Bubble sort, erstellt von T W am 17/01/2019.
- Erstellt von
- T W
- Aufrufe
- 0
- Bewertung