Exemplo n.º 1
0
void qsortt(char *lines[], int left, int right) {
    if ( left >= right )
        return;
    printf("left=%d, right=%d\n", left, right);
    
    int i, last;
    last = left;
    for (i = left + 1; i <= right; i++) {
        if ( (strcmp(lines[i], lines[left])) < 0 ) {
            swapt(lines, i, ++last);
        }
    }
    swapt(lines, last, left);
    
    qsortt(lines, left, last-1);
    qsortt(lines, last+1, right);
    
}
Exemplo n.º 2
0
int main() {
    
    char *lines[MAXLINES];
    int nl;
    
    if ( (nl = readlines(lines, MAXLINES)) > 0 ) {
        printf("Hello\n");
        qsortt(lines, 0, nl - 1);
        printf("Sort is fine\n");
        writelines(lines, nl);
    }
    
    
    return 0;
}
Exemplo n.º 3
0
void qsortt(void *a, size_t n, size_t es, int (*cmp)(const void *, const void *))
{
  char *pa, *pb, *pc, *pd, *pl, *pm, *pn;
  int d, swaptype, swap_cnt;
  int r;
  printf("this is a test\n");

loop: SWAPINIT(a, es);
  swap_cnt = 0;
  if (n < 7) {
    for (pm = (char *)a + es; pm < (char *) a + n * es; pm += es)
      for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0;
           pl -= es)
        swap(pl, pl - es);
    return;
  }
  pm = (char *)a + (n / 2) * es;
  if (n > 7) {
    pl = a;
    pn = (char *)a + (n - 1) * es;
    if (n > 40) {
      d = (n / 8) * es;
      pl = med3(pl, pl + d, pl + 2 * d, cmp);
      pm = med3(pm - d, pm, pm + d, cmp);
      pn = med3(pn - 2 * d, pn - d, pn, cmp);
    }
    pm = med3(pl, pm, pn, cmp);
  }
  swap(a, pm);
  pa = pb = (char *)a + es;

  pc = pd = (char *)a + (n - 1) * es;
  for (;;) {
    while (pb <= pc && (r = cmp(pb, a)) <= 0) {
      if (r == 0) {
        swap_cnt = 1;
        swap(pa, pb);
        pa += es;
      }
      pb += es;
    }
    while (pb <= pc && (r = cmp(pc, a)) >= 0) {
      if (r == 0) {
        swap_cnt = 1;
        swap(pc, pd);
        pd -= es;
      }
      pc -= es;
    }
    if (pb > pc)
      break;
    swap(pb, pc);
    swap_cnt = 1;
    pb += es;
    pc -= es;
  }
  if (swap_cnt == 0) {  /* Switch to insertion sort */
    for (pm = (char *)a + es; pm < (char *) a + n * es; pm += es)
      for (pl = pm; pl > (char *) a && cmp(pl - es, pl) > 0; 
           pl -= es)
        swap(pl, pl - es);
    return;
  }

  pn = (char *)a + n * es;
  r = min(pa - (char *)a, pb - pa);
  vecswap(a, pb - r, r);
  r = min((size_t)(pd - pc), pn - pd - es);
  vecswap(pb, pn - r, r);
  if ((size_t)(r = pb - pa) > es)
    qsortt(a, r / es, es, cmp);
  if ((size_t)(r = pd - pc) > es) { 
    /* Iterate rather than recurse to save stack space */
    a = pn - r;
    n = r / es;
    goto loop;
  }
/*    qsortt(pn - r, r / es, es, cmp);*/
}