Sorting Algorithims

Cards (7)

  • There are 3 ways to sort a list using Bubble, Merge and Insertion Sort.
  • Bubble Sort - Pros: Simple, Uses less memory and can be easily implemented on a computer.
  • Bubble Sort - Cons: Not suitable for large lists and is inefficient.
  • Merge Sort - Pros: More quicker, efficent and is suitable for Large lists.
  • Merge Sort - Cons : Uses more memory and is not suitable for small lists.
  • Insertion Sort - Pros : Is the quickest, simplest and can be easily coded.
  • Insertion Sort - Cons : Not suitable for large lists.