I've never heard of that being done. Your best bet would be to allocate a new array one element smaller than your last, assign the old array to it, starting with the second element, and deleting the entire old array.
Code:
#include <iostream>
const char ARRAYSIZE = 10;
int main() {
int *Arry1, *Arry2;
Arry1 = new int[ARRAYSIZE];
std::cout << "Array 1:" << std::endl;
for(int i = 0; i < ARRAYSIZE; i++) {
Arry1[i] = i * 5;
std::cout << Arry1[i] << ' ';
}
Arry2 = new int[ARRAYSIZE-1];
std::cout << "\n\nArray 2:" << std::endl;
for(int i = 0; i < ARRAYSIZE-1; i++) {
Arry2[i] = Arry1[i+1];
std::cout << Arry2[i] << ' ';
}
delete[] Arry1;
delete[] Arry2;
return 0;
}
*Note: I'm assuming that by "delete an element" you mean physically remove from memory. I should hope a person taking a data structures class should know how to overwrite an element.