Sort an Integer List The Challenge

It's quite simple really, sort a list of numbers.

Details

You must sort a list of numbers in ascending order, without using any built-in sorting functions/libraries/etc (i.e. list.sort() in Python). 

Input/output can be done in any method you choose, as long as it is human readable. 

Standard loopholes are disallowed as always. 

Shortest code in bytes wins.

You must explain/list what sort method you used (Bubble, Insertion, Selection, etc.)

Input will not contain duplicates.

Sample Input/Output

Input: 99,-2,53,4,67,55,23,43,88,-22,36,45

Output: -22,-2,4,23,36,43,45,53,55,67,88,99

Note: A near direct opposite of Sort a List of Numbers
05AB1E, 2 bytes
Code:
œß

Same algorithm as the Jelly answer. Computes all permutations of the input and pops out the smallest one.
Try it online!

A more efficient method is:
E[ß,Ž

Performs selection sort. Uses CP-1252 encoding.
Try it online!