samples/alpha-mj-exp/sort-insert.mj

   1 program sort {
   2
   3         int[] load()
   4                 int[] res;
   5                 int c,num,in; {
   6                 print('l');
   7                 print('?');
   8                 read(num);
   9                 res = new int[num];
  10                 c = 0;
  11                 while (c<num) {
  12                         print(c);
  13                         print('?');
  14                         read(in);
  15                         res[c] = in;
  16                         c++;
  17                 }
  18                 return res;
  19         }
  20
  21         void printar(int[] arr)
  22                 int c;
  23         {
  24                 c = 0;
  25                 while (c < len(arr)) {
  26                         print(arr[c]);
  27                         print(' ');
  28                         c++;
  29                 }
  30                 print(chr(10));
  31         }
  32
  33         void sort(int[] arr)
  34                 int i,j,t;
  35         {
  36                 i = 1;
  37                 while (i < len(arr)) {
  38                         j = i;
  39                         t = arr[j];
  40                         while (j > 0 && t < arr[j-1]) {
  41                                 arr[j]=arr[j-1];
  42                                 j = j - 1;
  43                         }
  44                         arr[j] = t;
  45                         i++;
  46                 }
  47
  48         }
  49
  50         void main()
  51                 int[] arr;
  52         {
  53                 arr = load();
  54                 printar(arr);
  55                 sort(arr);
  56                 printar(arr);
  57         }
  58 }