Bubble sorting actually is probably one or the simplest algorithms. Bubble sort basically looks at (from 0) each array item, and compares it to the one after that. If the one after it is bigger, swap the two values. It does this all the way to the end, until it's finished. Surprisingly easy to code.