using System;
using System.Collections;
using System.Runtime.CompilerServices;
namespace HelloWorldApplication
{
struct KeyType
{
public int key;
};
struct SqList
{
public KeyType\[\] r;
public int length;
};
class HelloWorld
{
static int maxSize = 100;
private static void BInsertSort(SqList l)
{
KeyType temp;
Console.WriteLine("排序前:l.key:{0}, l.length:{1}", StrSqList(l), l.length);
for (int i = 1; i < l.length; i++)
{
temp = l.ri;
int low = 0;
int high = i - 1;
while (low <= high)
{
int m = (low + high) / 2;
if (temp.key < l.rm.key)
{
high--;
} else
{
low++;
}
}
for (int j = i - 1; j >= high + 1; j--)
{
l.rj + 1.key = l.rj.key;
}
l.rhigh + 1.key = temp.key;
// Console.WriteLine("排序中:l.key:{0}, l.length:{1}", StrSqList(l), l.length);
}
Console.WriteLine("排序后:l.key:{0}, l.length:{1}", StrSqList(l), l.length);
}
private static string StrSqList(SqList l)
{
int \[\]a = new intl.length;
for(int i=0; i < l.length; i++)
{
ai = l.ri.key;
}
return string.Join(",", a);
}
static void Main(string\[\] args)
{
/* 我的第一个 C# 程序*/
// 初始化线性表
SqList l;
l.r = new KeyTypemaxSize;
int \[\]r = new int\[\]{49,38,65,97,76,13,27,49 };
KeyType key;
for(int i = 0; i < r.Length; i++)
{
key.key = ri;
l.ri = key;
}
l.length = r.Length;
// 调用排序算法
BInsertSort(l);
Console.ReadKey();
}
}
}