Worstsort program

void worstsort (element list[], int n)
/* this may be the shortest sorting algorithm 
   to write, but it is not very efficient
 see http://www-cs-staff.stanford.edu/~knuth/
 for more information on sorting*/
{  int i;
    element temp;
    100: for (i=0, i < n-1; i++)
                if (list[i] > list[i+1])
                   {  temp=list{i};
                      list[i]=list[i+1];
                      list[i+1]=temp;
                      go to 100;
                   }
}