/* For testing quicksort.S. */
#include <stdlib.h>
#include <stdio.h>

void quirks(int *first, int *last);

int main(int argc, char **argv)
{
  int *ints = &argc;
  if (argc > 1) {         /* I forget if malloc(0) is legal in ANSI */
    ints = malloc((argc - 1) * sizeof(ints[0]));
    if (!ints) {
      perror("malloc");
      return -1;
    }
  }

  printf("sorting");
  for (size_t i = 0; i < argc - 1; i++) {
    ints[i] = atoi(argv[i + 1]);
    printf(" %d", ints[i]);
  }
  printf("\n");

  quirks(ints, ints + argc - 2);

  printf("sorted:");
  for (size_t i = 0; i < argc - 1; i++) {
    printf(" %d", ints[i]);
  }
  printf("\n");

  return 0;
}