Help with Quicksort

[hopesfall]

In the quick sort algorithm, how would I choose a "pivot"? My assignment is to count how many comparisons the quick sort algorithm makes but I first need to implement part of the quick sort. This is what was given:

/** Partitions an array for quicksort. */
void partition(int theArray[],
               int first, int last, int& pivotIndex)
{
   // place pivot in theArray[first]
   choosePivot(theArray, first, last);
   int pivot = theArray[first];     // copy pivot
...
}

but the choosePivot function was not entirely given, only this was:

/** Chooses a pivot for quicksort's partition algorithm and swaps */
void choosePivot(int theArray[], int first, int last){

// what should be done here?

}

[liquidfuzz]

Don't shy away dude, just try a place in the array and see what you get. You might be surprised. :-)