View mindmap
  • Algorithms
    • Sorts
    • Searchs
  • Insertion sort
    • 2. It then moves the element to its final position
    • 1. Works by repeatedly finding the next smallest or largest element in the array.
    • Sorts
    • Advantages
      • Very simple
      • Exhibits a good performance when dealing with a small list
      • Required space is minimal to carry out the sort
    • Disadvantages
      • Struggles to deal with large lists
    • Insertion sort


No comments have yet been made

Similar Computing resources:

See all Computing resources »See all Algorithms resources »