Google Code-in

Implement the sorting-algorithm "Quicksort" using Pocket Code.

The user enters a unsorted sequence of numbers, your program shows the sorted sequence. For example: 51428 -> 12458

TODO:

1. Read through the internet and learn how this algorithm works
2. Implement the algorithm in Pocket Code. The user may select to either do a complete run-through of the algorithm, or go through it step by step.
3. Make an Introduction screen where you explain (step by step) with an example how this algorithm works.

OPTIONAL: find out what asymptotic growth (Big O Notation) is and explain it in your Introduction screen. Also add the best, average and worst case of your algorithm and explain it.