maopao.cpp

用C++语言简单的实现数据结构中数据的冒泡排序算法的程序代码

#include <iostream.h>
#include <conio.h>

#define MAXSIZE 50
void BubbleSort (int R[], int n)
{	
	for(int i = 0; i < n; i++)
        for(int j = 0; j < n - i - 1; j++)
            if(R[j] > R[j+1])	
			{
				int temp = R[j+1];
				R[j+1] = R[j];
				R[j] = temp;
			}
}	// BubbleSort
void main()
{
	char next = 'y';
	int n, i, m2;
	int *num;
	int *num2;
	int *num3;
	cout<<"输入元素的个数:"<<endl;
	cin>>n;
	num = new int[n];
	num2 = new int[n];
	num3 = new int[n + 1];
	cout<<"输入元素:"<<endl;
	for(i = 0; i < n; i++)
		cin>>num[i];
	cout<<"你输入的元素是:"<<endl;
	for(i = 0; i < n; i++)
		cout<<num[i]<<" ";
	cout<<endl;
for(i=0; i<n; i++)
		num2[i]=num[i];
	cout<<"冒泡排序:"<<endl;
	BubbleSort(num2, n);
	for(i = 0; i < n; i++)
		cout<<num2[i]<<" ";
	cout<<endl;
}