【C++数据结构】插入排序/折半插入排序

插入排序

#include<iostream>
#include<string>
using namespace std;

void output(int arr[],int len)
{
	for (int i = 0; i < len; i++)
	{
		cout << arr[i] << " ";
	}
	cout << endl;
}

void charu(int arr[], int len)
{
	for (int i = 1; i <= len - 1; i++)
	{
		if (arr[i] < arr[i - 1])
		{
			int temp = arr[i];
			int loc = i;
			while (temp < arr[loc - 1] && loc >= 1)
			{
				arr[loc] = arr[loc-1];
				loc--;
			}
			arr[loc] = temp;
		}
	}
}

int main()
{
	int arr[] = { 5,7,8,3,2,6,7 };
	int length = sizeof(arr) / sizeof(int);
	//kuaisu(arr, length,0,length-1);
	charu(arr, length);
	output(arr, length);



	return 0;
}

折半插入排序

#include<iostream>
#include<string>
using namespace std;

void output(int arr[],int len)
{
	for (int i = 0; i < len; i++)
	{
		cout << arr[i] << " ";
	}
	cout << endl;
}

void charu(int arr[],int length)
{
	int  len = length;
	for (int i = 1; i < len; i++)
	{
		for (int j = 0; j < i; j++)
		{
			if (arr[i] < arr[j])
			{
				int temp = arr[i];
				for (int k = i; k > j; k--)
				{
					arr[k] = arr[k - 1];
				}
				arr[j] = temp;
				break;
			}
		}
	}
}

void zheban(int arr[], int len)
{
	int i, j, low, high, mid;
	for (i = 1; i < len; i++)
	{
		int temp = arr[i];
		low = 0;
		high = i-1;
		while (low <= high)
		{
			mid = (low + high) / 2;
			if (temp < arr[mid])
				high = mid - 1;
			else
				low = mid + 1;
		}
		for (j = i; j > high + 1; j--)
		{
			arr[j] = arr[j - 1];
		}
		arr[high + 1] = temp;
	}
}

int main()
{
	int arr[] = { 5,7,8,3,2,6,7 };
	int length = sizeof(arr) / sizeof(int);
	output(arr, length);
	//charu(arr, length);
	zheban(arr, length);
	output(arr, length);

	 


	return 0;
}