周末躲在家里苦修.... 各种算法感觉啃起来还真是有些费劲... 不再废话了,贴调试的C#实现:
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace QuickSort
{
class Program
{
static void Main(string[] args)
{
int[] num = new int[11];
num[0] = 0;
for (int i = 1; i < num.Length; i++)
num[i] = num.Length - i;
PrintNum(num);
QuickSort(num);
Console.WriteLine("/n"+"After sorting"+"/n");
PrintNum(num);
}
static void QuickSort(int[] num)
{
for (int i = 2; i < num.Length; i++)
{
int j = i - 1;
if (num[i] < num[j])
{
num[0] = num[i];
num [j+1]=num [j];
j--;
for (;num[0] < num[j]; j--)
{
num[j + 1] = num[j];
}
num[j + 1] = num[0];
}
}
}
static void PrintNum(int[] num)
{
for (int i = 1; i < num.Length; i++)
Console.WriteLine(num[i]);
}
}
}