[   ^ to index...   |   <-- previous   |   next -->   ]

Group exercises

1. Write a templated version of BubbleSort, or any other trivial sort, for arrays. (You may want to write a helper template swap() (Truth: the standard template library defines a swap() template, but try it anyway).)

2. Write the class declaration for a templated Vector class implemented as a dynamic array. Next, implement the retrieveAtPosition(int i) method. Finally, define the overloaded operator[ ](int i).


Last modified: Mon Jul 31 21:34:39 PDT 2000