实验报告4：群体类和群体数据(6)

template

Array::Array(int sz) {

if (sz <= 0)

Error(invalidArraySize); size = sz;

alist = new T[size]; if (alist == NULL)

Error(memoryAllocationError); }

template Array::~Array(void) {

delete [] alist; }

template

Array::Array(const Array& X) {

int n = X.size; size = n;

alist = new T[n]; if (alist == NULL)

Error(memoryAllocationError); T* srcptr = X.alist; T* destptr = alist; while (n--)

*destptr++ = *srcptr++; }

template

Array& Array::operator= (const Array& rhs) {

int n = rhs.size; if (size != n) {

delete [] alist; alist = new T[n]; if (alist == NULL)

Error(memoryAllocationError); size = n; }

T* destptr = alist; T* srcptr = rhs.alist; while (n--)

*destptr++ = *srcptr++;

26

return *this; }

template

T& Array::operator[] (int n) {

if (n < 0 || n > size-1) Error(indexOutOfRange,n); return alist[n]; }

template

Array::operator T* (void) const {

return alist; }

template

int Array::ListSize(void) const {

return size; }

template

void Array::Resize(int sz) {

if (sz <= 0)

Error(invalidArraySize); if (sz == size) return;

T* newlist = new T[sz]; if (newlist == NULL)

Error(memoryAllocationError); int n = (sz <= size) ? sz : size; T* srcptr = alist; T* destptr = newlist; while (n--)

*destptr++ = *srcptr++; delete[] alist; alist = newlist; size = sz; }

template

void Array::InsertionSort() {

int i, j; T temp;

for (i = 1; i < size; i++)

27

{

j = i;

temp = alist[i];

while (j > 0 && temp < alist[j-1]) {

alist[j] = alist[j-1]; j--; }

alist[j] = temp; } }

template

void Array::SelectionSort() {

int smallIndex; int i, j;

for (i = 0; i < size-1; i++) {

smallIndex = i;

for (j = i+1; j < size; j++)

if (alist[j] < alist[smallIndex]) smallIndex = j;

Swap(alist[i], alist[smallIndex]); } }

template void Swap (T &x, T &y) {

T temp; temp = x; x = y; y = temp; }

template

void Array::BubbleSort() {

int i,j;

int lastExchangeIndex; i = size-1; while (i > 0) {

lastExchangeIndex = 0; for (j = 0; j < i; j++)

if (alist[j+1] < alist[j])

28

{

Swap(alist[j],alist[j+1]); lastExchangeIndex = j; }

i = lastExchangeIndex; } }

template

int Array::SeqSearch(T key) {

for(int i=0;i < size;i++) if (alist[i] == key) return i; return -1; }

#endif

四、实验结果

1、

2、

3、

4、 5、

29

30