#ifndef QUICKSORT_H
#define QUICKSORT_H
/*----------------------------------------------------------------------------*/
/* Sequential and Multithreaded Quicksort Function Declarations               */
/*                                                                            */
/* Written by: John Thornley, Computer Science Dept., Caltech.                */
/* Date: October, 1997.                                                       */
/*                                                                            */
/* Copyright (c) 1997 by John Thornley.                                       */
/*----------------------------------------------------------------------------*/

typedef int item;

void seq_quicksort(int n, item data[]);
/* Precondition:                                                              */
/*     n >= 0 and data[0 .. n - 1] allocated.                                 */
/* Postcondition:                                                             */
/*     ascending(data[0 .. n - 1]) and                                        */
/*     permutation(data[0 .. n - 1], in data[0 .. n - 1]).                    */

void multi_quicksort(int n, item data[], int t); 
/* Precondition:                                                              */
/*     n >= 0 and data[0 .. n - 1] allocated and t >= 1.                      */
/* Postcondition:                                                             */
/*     ascending(data[0 .. n - 1]) and                                        */
/*     permutation(data[0 .. n - 1], in data[0 .. n - 1]).                    */

/*----------------------------------------------------------------------------*/
#endif /* !QUICKSORT_H */