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

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