排序

冒泡排序

#include<stdio.h>
#include <stdlib.h>


void main1()
{

	int a[10] = { 3, 5, 18, 9, 23, 5, 2, 1, 0 ,2};
	            //      9   18 5  2  1  , 0,2 23

	for (int i = 0; i < 10 - 1;i++)//N -1  
	{
		if (a[i] >a[i+1])//对比
		{
			int temp = a[i];//交换
			a[i] = a[i + 1];
			a[i + 1] = temp;
		}
		for (int i = 0; i < 10;i++)
		{
			printf("%d  ", a[i]);
		}
		printf("\n");
	}
	//printf("%d", a[9]);



	getchar();
}


void  main2()
{
#define  N 10
	int a[N] = { 3, 5, 18, 9, 23, 5, 2, 1, 0, 2 };

	for (int i = 0; i < N - 1;i++)//每循环一次，就有一个最大值沉底
	{
		for (int j = 0; j < N - 1 - i;j++)//沉底的次数，决定冒到哪里
		{
			if (a[j]>a[j+1])//沉底
			{
				int temp = a[j];
				a[j] = a[j + 1];
				a[j + 1] = temp;//
			}
		}


		for (int i = 0; i < N; i++)
		{
			printf("%d  ", a[i]);
		}
		printf("\n");

	}

	getchar();
}

插入排序

#include <stdio.h>
#include <stdlib.h>


void main1()
{
	int a[10] = { 1, 2, 3, 4, 6, 7, 8, 9, 10, 5 };

	int temp = a[9];
	int j = 9;//记录下标

	while (j>0  &&  a[j-1] >temp )//a[j-1] >temp确定要插入的位置
	{
		a[j] = a[j - 1];//往前移动
		j--;
		for (int i = 0; i < 10; i++)
		{
			printf("%d  ", a[i]);
		}
		printf("\n");
	}
	a[j] = temp;


	for (int i = 0; i < 10; i++)
	{
		printf("%d  ", a[i]);
	}
	printf("\n");





	getchar();
}

void  main()
{

	int a[10] = { 1, 5, 2, 4, 3, 8, 7, 9, 10, 6 };


	for (int i = 1; i < 10;i++)//只有一个不需要插入
	{
		int temp = a[i];
		int j = i;

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

			a[j] = a[j - 1];//往后移动
			j--;

		}

		a[j] = temp;

		for (int i = 0; i < 10; i++)
		{
			printf("%d  ", a[i]);
		}
		printf("\n");

	}


	for (int i = 0; i < 10; i++)
	{
		printf("%d  ", a[i]);
	}
	printf("\n");



	system("pause");






}