Read Chapter 8 on Iterators and Visitation. Use the vector code as written and implement an iterator based sorting algorithm and an iterator based bisection search.

The sorting routine should be other than quicksort or bubblesort. Use asserts (or if ambitious exceptions) to guarantee the sorting routine works.

Test the sorting routine by randomly generating integer data. Generate and store 10,000 elements. Then use time.h to measure the running time of your sorting routine. Print this out and indicate the machine you are using in your documentation.

Test the bisection based search routine in a reasonable way. Decide what should be returned if the element searched for is not found.

//Use code found on page 256-257

class vector
public:
typedef int* iterator;;
...
};
void my_sort(vector::iterator from, vector::iterator to);
vector::iterator find(
vector::iterator from,
vector::iterator to); /* return 0 if unfound */

Due Date: In class May 8,1997, 4:00pm.

Last Modified: 02:04pm , April 26, 1997