// Sort.h
// Name:  Gary T. Leavens
// TA:    Bjarne Stroustrup
// Section:  A1

extern void Sort( int vec[], int size );
  // PRE: 0 <= size
  // MODIFIES: vec[i], for each i
  // POST: vec[0..size-1] contains the same values
  // as vec[0..size-1]<entry>, and vec[0..size-1] is in ascending order