int main();
int putd(int );
int sort(int *,int );
int quick(int *,int ,int );
int partition(int *,int ,int );
int exchange(int *,int *);

int in[10] = {10,
32,
-1,
567,
3,
18,
1,
-51,
789,
0};

int *xx;

static char *lance_static_t92 = "exchange(%d,%d)\n";

int main()
{
 int i_4;
 
int t22;
 char *t25;
 int t26;
 char *t27;
 int *t28;
 int t29;
 int t30;
 int t31;
 int t32;


 /* 8 "sort.c" */
 
/* $ sort(in, (sizeof in)/(sizeof in[0]));$ */

     
t22 = sort(in,10);

 
/* 9 "sort.c" */
 /* $ for (i = 0; i < (sizeof in)/(sizeof in[0]); i++) {$ */

      i_4 = 0;

 /* 10 "sort.c" */
 /* $ putd(in[i]);$ */

     
t25 = (char *)in;

 
/* 9 "sort.c" */
 /* $ for (i = 0; i < (sizeof in)/(sizeof in[0]); i++) {$ */

 LL2:

 /* 10 "sort.c" */
 /* $ putd(in[i]);$ */

      t26 = 4 * i_4;
      t27 = t25 + t26;
      t28 = (int *)t27;
      t29 = putd(*t28);

 /* 11 "sort.c" */
 /* $ putchar('\n');$ */

      t30 = putchar('\x0a');

 /* 9 "sort.c" */
 /* $ for (i = 0; i < (sizeof in)/(sizeof in[0]); i++) {$ */

      t31 = 1 + i_4;
      i_4 = t31;
      t32 = t31 < 10;
      if (t32) goto LL2;


 /* 13 "sort.c" */
 /* $ return 0;$ */

      return 0;

}

int putd(int n_8)
{
 int t34;
 int t35;
 int t36;
 int t37;
 int t39;
 int t41;
 int t42;
 int t43;
 int t44;
 int t45;
 int t1;


 /* 18 "sort.c" */
 /* $ if (n < 0) {$ */

      t34 = n_8 < 0;
      t35 = !t34;
      if (t35) goto LL4;


 /* 19 "sort.c" */
 /* $ putchar('-');$ */

      t36 = putchar('\x2d');

 /* 20 "sort.c" */
 /* $ n = -n;$ */

      t37 = -n_8;
      n_8 = t37;

 /* 18 "sort.c" */
 /* $ if (n < 0) {$ */

 LL4:

 /* 22 "sort.c" */
 /* $ if (n/10)$ */

      t1 = n_8 / 10;
      t39 = !t1;
      if (t39) goto LL5;


 /* 23 "sort.c" */
 /* $ putd(n/10);$ */

      t41 = putd(t1);

 /* 22 "sort.c" */
 /* $ if (n/10)$ */

 LL5:

 /* 24 "sort.c" */
 /* $ putchar(n%10 + '0');$ */

      t42 = n_8 % 10;
      t43 = (int )'\x30';
      t44 = t42 + t43;
      t45 = putchar(t44);

 /* 0 "???" */
 /* $ ???$ */

      return;

}

int sort(int *a_14,int n_15)
{
 int **t46;
 int t47;
 int t48;


 /* 31 "sort.c" */
 /* $ quick(xx = a, 0, --n);$ */

      t46 = &xx;
      *t46 = a_14;
      t47 = -1 + n_15;
      t48 = quick(*t46,0,t47);

 /* 0 "???" */
 /* $ ???$ */

      return;

}

int quick(int *a_19,int lb_20,int ub_21)
{
 int t49;
 int t50;
 int t51;
 int t52;
 int t53;
 int t54;
 int t55;


 /* 38 "sort.c" */
 /* $ if (lb >= ub)$ */

      t49 = lb_20 >= ub_21;
      t50 = !t49;
      if (t50) goto LL6;


 /* 39 "sort.c" */
 /* $ return;$ */

      return;


 /* 38 "sort.c" */
 /* $ if (lb >= ub)$ */

 LL6:

 /* 40 "sort.c" */
 /* $ k = partition(a, lb, ub);$ */

      t51 = partition(a_19,lb_20,ub_21);

 /* 41 "sort.c" */
 /* $ quick(a, lb, k - 1);$ */

      t52 = -1 + t51;
      t53 = quick(a_19,lb_20,t52);

 /* 42 "sort.c" */
 /* $ quick(a, k + 1, ub);$ */

      t54 = 1 + t51;
      t55 = quick(a_19,t54,ub_21);

 /* 0 "???" */
 /* $ ???$ */

      return;

}

int partition(int *a_26,int i_27,int j_28)
{
 int v_30;
 int t92;
 char *t95;
 int *t96;
 int t97;
 int t98;
 int t99;
 int t101;
 char *t102;
 int *t103;
 int t104;
 int t105;
 int t106;
 int t107;
 int t109;
 char *t110;
 int *t111;
 int t112;
 int t113;
 int t114;
 int t115;
 int t116;
 int t118;
 char *t119;
 int *t120;
 char *t121;
 int t122;
 char *t123;
 int *t124;
 int t125;
 char *t128;
 int *t129;
 int t131;
 char *t132;
 int *t133;
 int t134;
 char *t2;
 int t3;


 /* 49 "sort.c" */
 /* $ j++;$ */

      t92 = 1 + j_28;
      j_28 = t92;

 /* 51 "sort.c" */
 /* $ v = a[k];$ */

      t2 = (char *)a_26;
      t3 = 4 * i_27;
      t95 = t2 + t3;
      t96 = (int *)t95;
      v_30 = *t96;

 /* 52 "sort.c" */
 /* $ while (i < j) {$ */

 LL16:
      t97 = i_27 < j_28;
      t98 = !t97;
      if (t98) goto LL7;


 /* 53 "sort.c" */
 /* $ i++; while (a[i] < v) i++;$ */

      t99 = 1 + i_27;
      i_27 = t99;
 LL11:
      t101 = 4 * i_27;
      t102 = t2 + t101;
      t103 = (int *)t102;
      t104 = *t103 < v_30;
      t105 = !t104;
      if (t105) goto LL9;

      t106 = 1 + i_27;
      i_27 = t106;
      goto LL11;

 LL9:

 /* 54 "sort.c" */
 /* $ j--; while (a[j] > v) j--;$ */

      t107 = -1 + j_28;
      j_28 = t107;
 LL14:
      t109 = 4 * j_28;
      t110 = t2 + t109;
      t111 = (int *)t110;
      t112 = *t111 > v_30;
      t113 = !t112;
      if (t113) goto LL12;

      t114 = -1 + j_28;
      j_28 = t114;
      goto LL14;

 LL12:

 /* 55 "sort.c" */
 /* $ if (i < j) exchange(&a[i], &a[j]);$ */

      t115 = i_27 < j_28;
      t116 = !t115;
      if (t116) goto LL16;

      t118 = 4 * i_27;
      t119 = t2 + t118;
      t120 = (int *)t119;
      t121 = (char *)a_26;
      t122 = 4 * j_28;
      t123 = t121 + t122;
      t124 = (int *)t123;
      t125 = exchange(t120,t124);

 /* 52 "sort.c" */
 /* $ while (i < j) {$ */

      goto LL16;

 LL7:

 /* 57 "sort.c" */
 /* $ exchange(&a[k], &a[j]);$ */

      t128 = t2 + t3;
      t129 = (int *)t128;
      t131 = 4 * j_28;
      t132 = t2 + t131;
      t133 = (int *)t132;
      t134 = exchange(t129,t133);

 /* 58 "sort.c" */
 /* $ return j;$ */

      return j_28;

}

int exchange(int *x_36,int *y_37)
{
 int t_39;
 char *t135;
 char *t137;
 int t138;
 int t139;
 char *t140;
 char *t142;
 int t143;
 int t144;
 int t145;
 int **t4;


 /* 65 "sort.c" */
 /* $ printf("exchange(%d,%d)\n", x - xx, y - xx);$ */

      t135 = (char *)x_36;
      t4 = &xx;
      t137 = (char *)*t4;
      t138 = t135 - t137;
      t139 = t138 / 4;
      t140 = (char *)y_37;
      t142 = (char *)*t4;
      t143 = t140 - t142;
      t144 = t143 / 4;
      t145 = printf(lance_static_t92,t139,t144);

 /* 66 "sort.c" */
 /* $ t = *x; *x = *y; *y = t;$ */

      t_39 = *x_36;
      *x_36 = *y_37;
      *y_37 = t_39;

 /* 0 "???" */
 /* $ ???$ */

      return;

}