remote TABs in doc/ and test/

[cc65] / test / ref / sort.c

diff --git a/test/ref/sort.c b/test/ref/sort.c
index 5db5cf01bfbbcd768543bf58716b8db5ed2712a7..b4dee87342da8fdb0f14e5d554509e7e9b154426 100644 (file)
--- a/test/ref/sort.c
+++ b/test/ref/sort.c
@@ -14,62 +14,62 @@ int *xx;
 exchange(int *x,int *y) {
 int t;
 
-       printf("exchange(%d,%d)\n", x - xx, y - xx);
-       t = *x; *x = *y; *y = t;
+        printf("exchange(%d,%d)\n", x - xx, y - xx);
+        t = *x; *x = *y; *y = t;
 }
 
 /* partition - partition a[i..j] */
 int partition(int a[], int i, int j) {
 int v, k;
 
-       j++;
-       k = i;
-       v = a[k];
-       while (i < j) {
-               i++; while (a[i] < v) i++;
-               j--; while (a[j] > v) j--;
-               if (i < j) exchange(&a[i], &a[j]);
-       }
-       exchange(&a[k], &a[j]);
-       return j;
+        j++;
+        k = i;
+        v = a[k];
+        while (i < j) {
+                i++; while (a[i] < v) i++;
+                j--; while (a[j] > v) j--;
+                if (i < j) exchange(&a[i], &a[j]);
+        }
+        exchange(&a[k], &a[j]);
+        return j;
 }
 
 /* quick - quicksort a[lb..ub] */
 void quick(int a[], int lb, int ub) {
         int k;
 
-       if (lb >= ub)
-               return;
-       k = partition(a, lb, ub);
-       quick(a, lb, k - 1);
-       quick(a, k + 1, ub);
+        if (lb >= ub)
+                return;
+        k = partition(a, lb, ub);
+        quick(a, lb, k - 1);
+        quick(a, k + 1, ub);
 }
 
 /* sort - sort a[0..n-1] into increasing order */
 sort(int a[], int n) {
-       quick(xx = a, 0, --n);
+        quick(xx = a, 0, --n);
 }
 
 /* putd - output decimal number */
 void putd(int n) {
-       if (n < 0) {
-               putchar('-');
-               n = -n;
-       }
-       if (n/10)
-               putd(n/10);
-       putchar(n%10 + '0');
+        if (n < 0) {
+                putchar('-');
+                n = -n;
+        }
+        if (n/10)
+                putd(n/10);
+        putchar(n%10 + '0');
 }
 
 int main(void) {
-       int i;
+        int i;
 
-       sort(in, (sizeof in)/(sizeof in[0]));
-       for (i = 0; i < (sizeof in)/(sizeof in[0]); i++) {
-               putd(in[i]);
-               putchar('\n');
-       }
+        sort(in, (sizeof in)/(sizeof in[0]));
+        for (i = 0; i < (sizeof in)/(sizeof in[0]); i++) {
+                putd(in[i]);
+                putchar('\n');
+        }
 
-       return 0;
+        return 0;
 }