Sorting algorithms

Well sorting, you know? the process of rearranging an array of objects by its key. The elements must be comparable so satisfying total ordering:

• reflexive: for all v, v=v.
• antisymmetric: for all v and w, if v<w then w>v, and if v=w then w=v.
• transitive: for all v,w and x, if v<=w and w<=x then v<=x.

We're going to visit the following algorithms:

• Selection sort
• Insertion sort
• Shell sort