初学数据结构---直接插入排序

// 插入排序.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"

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

typedef int  KeyType;
const int MAXSIZE = 50;
typedef struct
{
	KeyType key;
} DataType;

typedef struct
{
	DataType data[MAXSIZE];
	int length;
}SqList;

//直接插入排序

void InsertSort(SqList *L)
{
	int i, j;
	DataType t;
	for(i = 1;i < L->length;i++)
	{
		t = L->data[i+1];
		j = i;
		while(j > -1 && t.key < L->data[j].key)
		{
			L->data[j + 1] = L->data[j];
			j--;
		}
		L->data[j + 1] = t;
	}
}

//折半插入排序
void BinInsertSort(SqList *L)
{
	int i, j, mid, low, high;
	DataType t;
	for(i = 1;i < L->length;i++)
	{
		t = L->data[i + 1];
		low = 1, high = i;
		while(low <= high)
		{
			mid = (low + high) / 2;
			if(L->data[mid].key > t.key)
			{
				high = mid - 1;
			}
			else
			{
				low = mid + 1;
			}
		}
		for(j = i;j >= low;j--)
		{
			L->data[j + 1] = L->data[j];
		}
		L->data[low] = t;
	}
}
void InitSeqList(SqList *L, DataType a[], int n)
{
	int i;
	for(i = 1;i <= n;i++)
	{
		L->data[i] = a[i - 1];
	}
	L->length = n;
}

void DispList(SqList L, int n)
{
	int i;
	for(i = 1;i <= n;i++)
	{
		cout << L.data[i].key << " ";
	}
	cout << endl;
}

int main()
{
	DataType a[] = { 56,22,67,32,59,12,89,26,48,37 };
	int delta[] = { 5,3,1 };
	int n = 10, m = 3;
	SqList L;
	InitSeqList(&L, a, n);
	cout << "排序前：" << endl;
	DispList(L,n);
	/*InsertSort(&L);
	cout << "直接插入排序：" << endl;
	DispList(L, n);*/
	BinInsertSort(&L);
	cout << "折半插入排序：" << endl;
	DispList(L, n);

    return 0;
}