Please enable JavaScript.

Coggle requires JavaScript to display documents.

Sorts (Basics (Insertion Sort (Really similar to how you sort cards (Focus…

- - - - Now we now the first element is right so we move to the next ignoring the first
        
        Rince and repeat
    - - We first go through the N elements once
        
        The next time we loop through it N -1 times. The one after will be N-2
        
        N x ( N-1) x(N-2) ... 1 = \(\frac{N * (N + 1)}{2}\)
      - Best cases
        
        None. This sort will always loop through the same amount of time regardless of what the order Starts out as
  - - - Focus on first two
        
        If last book is in the wrong place remove it and Shift down until you find the right place to put it
        
        Repeat this process until you're at the end of the elements
    - - If the elements are already sorted it just takes N iterations
    - - We loop through it 2 times and continue looping until we're at the end so last loop goes N times