Difference between revisions of "C Language Practice: Sorting - Insertion Sort"

Created page with "== Insertion Sort == '''What is insertion sort?''' We have an easy train of thought for insertion sort, but this sorting method is a bit slow. What we do in insertion sort is we pick up the second element, and we compare it with the first element. Then we pick the next(third) element and we keep comparing it with the elements before it(the second and first) until we meet an element that is smaller or equal to it. We then pick up our third element, move the list behind..."