template
class sortedVector
{
public:
// same functions as before. Now the insert function looks like this:
insert( T *val )
{
if ( length == vec_size ) // length is the number of elements
{
vec_size *= 2; // we'll just ignore overflow possibility!
vec_data = new T[vec_size];
}
++length; // we are about to add an element
// we'll start at the end, sliding elements back until we find the
// place to insert the new element
int pos;
for( pos = length; pos > 0 && *val > *vec_data[pos - 1]; --pos )
{
vec_data[pos] = vec_data[pos - 1];
}
vec_data[pos] = val;
}
private:
T** vec_data;
int length;
int size;
};
No comments:
Post a Comment