排序算法（一）

最新推荐文章于 2025-12-03 17:03:32 发布

最新推荐文章于 2025-12-03 17:03:32 发布 · 61 阅读

文章标签：

#数据结构与算法

本文深入介绍了非递归排序算法，包括冒泡排序、插入排序与希尔排序的原理与代码实现，通过实例展示排序过程，并提供优化版本的冒泡排序算法。

可以按照下图所示的方式进行分类

下面对非递归的排序进行介绍

1）冒泡排序

代码实现如下：

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

void bubble_sort(int num[], int length)
{
	int i = 0, j = 0;
	int temp = 0;
	
	if(NULL == num || 0 == length)
		return;

	for(j = length - 1; j >= 1; j--)
	{
		for(i = 0; i < j; i++)
		{
			if(num[i] > num[i + 1])
			{
				temp = num[i];
				num[i] = num[i + 1];
				num[i + 1] = temp;
			}
		}
	}
}

// The optimization bubble sort algorithm
void bubble_sort_optimization(int num[], int length)
{
	int i = 0, j = 0;
	int temp = 0;
	int flag = 1;
	
	if(NULL == num || 0 == length)
		return;

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

				if(flag == 0 )
					flag = 1;
			}
		}
	}
}

int main()
{
	int num[]={1,4,3,2,5};
	int length = 5;
	int i = 0;

	for(i = 0; i < length; i++)
	{
		printf("the %d original number is: %d\n", i + 1, num[i]);
	}

	bubble_sort_optimization(num, length);
	for(i = 0; i < length; i++)
	{
		printf("the %d sorted number is: %d\n", i + 1, num[i]);
	}

	system("pause");
	return 0;
}

2）插入排序

代码实现如下：

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

void insert_sort(int num[], int length)
{
	int i = 0, j = 0;
	int temp = 0;
	if(NULL == num || 0 == length)
		return;

	for(j = 1; j < length; j++)
	{
		for(i = j; i >= 1; i++)
		{
			if(num[i] < num[i - 1])
			{
				temp = num[i];
				num[i] = num[i - 1];
				num[i - 1] = temp;
			}
			else
			{
				break;
			}
		}
	}
}

int main()
{
	int num[] = {1, 4, 3, 2, 5};
	int length = 5;
	int i = 0;

	for(i = 0; i < length; i++)
	{
		printf("the %d original number is: %d\n", i + 1, num[i]);
	}

	insert_sort(num, length);
	for(i = 0; i < length; i++)
	{
		printf("the %d sorted number is: %d\n", i + 1, num[i]);
	}

	system("pause");
	return 0;
}

3）希尔排序

代码实现如下：

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

void shell_sort(int num[], int length, int step)
{
	int i = 0, j = 0;
	int temp = 0;
	int index = 0;

	if(NULL == num || 0 == length)
		return;

	for(; step >= 1; step -= 2)
	{
		for(index = 0; index < step; index++)
		{
			if((length - 1) < (index + step))
				continue;
			else
			{
				j = index + step;
				while((j + step) <= (length - 1))
					j += step;
			}

			for(; j >= (index + step); j -= step)
			{
				for(i = index; i <= j - step; i += step)
				{
					if(num[i] >= num[i + step])
					{
						temp = num[i];
						num[i] = num[i + step];
						num[i + step] = temp;
					}
				}
			}
		}
	}
}

int main()
{
	int num[] = {1, 4, 2, 3, 5};
	int length = 5;
	int step = 5;
	int i = 0;
	for(i = 0; i < length; i++)
	{
		printf("The %d orignal number is %d:\n", i + 1, num[i]);
	}

	shell_sort(num, length, step);
	for(i = 0; i < length; i++)
	{
		printf("The %d sorted number is %d:\n", i + 1, num[i]);
	}

	system("pause");
	return 0;
}

来自于: http://blog.youkuaiyun.com/feixiaoxing/article/details/6844826