[0] : counts the number of elements in the input array
[1],[2] : temporary space used for comparing two elements
[3],[4] : used for comparing two elements
[5],[6] : pivot that separates the input from the first five cells
[7] : temporary space required for each phase of the sorting
[8]...[8+n-1] : the input array
[8+n],[9+n] : temporary space used while reading input elements

1. (read input)
   start with i=8
   read a character from the input to [i]
   increment [0]
   copy from [i] to [i+1] with the usage of [i+2]
   test if [i+1] is [space] (ASCII==32)
     NO:
       i=i+1 and read the next character
     YES:
       reset [i]
       decrement [0]
   increment [6] (set pivot)
   decrement [0]
2. (perform n-1 sorting phases)
   test if [0]==0
     NO:
       2A. (start a single sorting phase)
           decrement [0]
           i=9
           until [i]==0:
             copy [i-1] to [1] and [3]
             copy [i] to [2] and [4]
             copy [1] back to [i-1]
             copy [2] back to [i]
             increment [1]
             2A1. (compare two elements and swap if [i-1]>[i])
                  until ([3]==0 OR [4]==0):
                    decrement [3], decrement [4]
                  case [4]==0:
                    copy [i-1] to [i-2]
                    copy [i] to [i-1]
                    copy [i-2] to [i]
             2A2. (clear markers for the next comparison)
                  decrement [1]
                  reset [3], reset [4]
                  copy [i-1] to [i-2]
                  i=i+1
           k=3
           until i-k==5:
             copy [i-k] to [i-k+1]
             k=k+1
           decrement [7], increment [6]
     YES:
       2B. (print the sorted array)
           i=8
           move to [i]
           until [i]==0:
             print [i], i=i+1, move to [i]