冒泡排序和选择法排序.cpp

来自「这个是我的大学作业哦 里面有些很经典的代码 出自清华大学的数据结构课本」· C++ 代码 · 共 89 行

//==========================
#include <iostream>
using namespace std;
//--------------------------
int main(){ 
	
	int m;
	int a[]={11,54,66,52,12,65,87,98,55,44,28};
/*
	for(int j=0; j<10; j++)
	{
		for (int i=0; i<11-j; i++)
		{    
			if (a[i] > a[i+1])
			{ 
				m = a[i];
				a[i] = a[i+1];
				a[i+1] = m;
			}
		}
	}
	for(int n=0;n<11;n++)
	{
		cout<< a[n] <<"   ";
	}

*/
//----------------------------------------------

/*

    for ( int i=0; i < 10; i++ )
	{
		for (int j = i+1; j < 10; j++ )
		{
			if(a[j] < a[j+1])
			{
				m = a[j];
				a[j] = a[j+1];
				a[j+1] = m;
			}
		}

		a[i] = a[10-i];
	}



  for(int n=0; n<11; n++)
	{
		cout<< a[n] <<"   ";
	}

*/
//----------------------------------------------

for (int i=0; i<10; i++)
	{
		for (int j=i+1; j<10; j++)
		{
			if(a[j] < a[j+1])
			{
				m = a[j];
				a[j] = a[j+1];
				a[j+1] = m;

			}
		}

		if(a[i] > a[10])
		{
			m = a[i];
			a[i] = a[10];
			a[10] = m;
		}
		
	}



  for(int n=0; n<11; n++)
	{
		cout<< a[n] <<"   ";
	}



	return 0;
}