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 InsertSort(SqList l)
{
KeyType temp;
for (int i = 1; i < l.length; i++)
{
if (l.r[i].key < l.r[i-1].key)
{ // 快速排序
temp = l.r[i];
l.r[i].key = l.r[i - 1].key;
int j = i - 2;
for (;j >= 0; j--)
{
if (temp.key < l.r[j].key)
{
l.r[j + 1].key = l.r[j].key;
}else {
// 找到插入位置提前退出循环
break;
}
}
l.r[j + 1].key = temp.key;
}
Console.WriteLine("排序中:l.key:{0}, l.length:{1}", StrSqList(l), l.length);
}
}
private static string StrSqList(SqList l)
{
int []a = new int[l.length];
for(int i=0; i < l.length; i++)
{
a[i] = l.r[i].key;
}
return string.Join(",", a);
}
static void Main(string[] args)
{
/* 我的第一个 C# 程序*/
// 初始化线性表
SqList l;
l.r = new KeyType[maxSize];
int []r = new int[]{49,38,65,97,76,13,27,49 };
KeyType key;
for(int i = 0; i < r.Length; i++)
{
key.key = r[i];
l.r[i] = key;
}
l.length = r.Length;
Console.WriteLine("排序前:l.key:{0}, l.length:{1}", StrSqList(l), l.length);
// 调用排序算法
InsertSort(l);
Console.WriteLine("排序后:l.key:{0}, l.length:{1}", StrSqList(l), l.length);
Console.ReadKey();
}
}
}