#include <algorithm> // Provides copy function

template <class value_type>
const typename Bag<value_type>::size_type Bag<value_type>::DEFAULT_CAPACITY;

template <class value_type>
Bag<value_type>::Bag(size_type initial_capacity)
{
data = new value_type[initial_capacity];
capacity = initial_capacity;
used = 0;
}

template <class value_type>
Bag<value_type>::Bag(const Bag<value_type>& source)
// Library facilities used: algorithm
{
data = new value_type[source.capacity];
capacity = source.capacity;
used = source.used;
copy(source.data, source.data + used, data);
}

template <class value_type>
void Bag<value_type>::reserve(size_type new_capacity)
// Library facilities used: algorithm
{
value_type *larger_array;

if (new_capacity == capacity)
return; // The allocated memory is already the right size.

if (new_capacity < used)
new_capacity = used; // Can't allocate less than we are using.

larger_array = new value_type[new_capacity];
copy(data, data + used, larger_array);
delete [] data;
data = larger_array;
capacity = new_capacity;
}

template <class value_type>
typename Bag<value_type>::size_type Bag<value_type>::erase(const value_type& target)
{
size_type index = 0;
size_type many_removed = 0;

while (index < used) {
if (data[index] == target) {
   --used;
   data[index] = data[used];
   ++many_removed;
}
else ++index;
}
return many_removed;
}

Heap sort Input (Standard input) The number of input keys N (1 ≤...