#include <iostream.h>

class Student
{
private:
	long  number;
	char  name[10];
	char  sex[3];
	int  age;
};

typedef int DataType;
void Reverse2(int n, DataType a[])
{
	int i, m = n/2;
	DataType temp;

	for(i = 0; i < m; i++)					//進(jìn)行m次調(diào)換
	{
		temp = a[i];
		a[i] = a[n - 1 - i];					
		a[n - 1 - i] = temp;
	}
}

void Reverse1(int n, DataType a[], DataType b[] )
{
	int i;

	for(i = 0; i < n; i++)					//為數(shù)組b的n個(gè)元素賦值
		b[i] = a[n - 1 - i];
}

void BubbleSort(int a[], int n)
{
		int i, j, flag=1;
		int temp;

		for(i = 1; i < n && flag == 1; i++)
		{
			flag = 0;
			for(j = 0; j < n-i; j++)
			{
				if(a[j] > a[j+1])
				{
					flag = 1;
					temp = a[j];
					a[j] = a[j+1];
					a[j+1] = temp;
				}
			}
		}
}

int Delete(int a[], int &n, int i)
{
	int j;

	if(i < 0 || i >= n) return 0;	//刪除位置錯(cuò)誤，失敗返回
	for(j = i + 1; j < n; j++) a[j-1] = a[j];//順次移位填補(bǔ)
	n--;									//數(shù)組元素個(gè)數(shù)減1
	return 1; 								//刪除成功返回
}

void main(void)
{
	int a[] = {8,2,7,3,4,5,6,1}, n = 8, b[8];

	BubbleSort(a, n);
	Delete(a, n, 8);
	for(int i = 0; i < n; i++)
		cout << a[i] << "   ";
}