排序算法是编程的基础。
常见的四种排序算法是：简单选择排序、冒泡排序、插入排序和快速排序。其中的快速排序的优势明显，一般使用递归方式实现，但遇到数据量大的情况则无法适用。实际工程中一般使用“非递归”方式实现。
快速排序(Quick Sort)算法（非递归方式）
实际工程中一般使用“非递归”方式实现。
做良心程序员，工程文件与源代码：
代码：
using System;
using System.Text;
using System.Collections.Generic;
using System.Windows.Forms;
namespace WindowsFormsApp6
{
public partial class Form1 : Form
{
Random rnd = new Random((int)DateTime.Now.Ticks);
List slides = new List();
public Form1()
{
InitializeComponent();
}
private void Form1_Load(object sender, EventArgs e)
{
this.Text = "C#，四种常见排序算法的可视化编程——北京联高软件开发有限公司";
button1.Text = "选择排序"; button1.Cursor = Cursors.Hand;
button2.Text = "冒泡排序"; button2.Cursor = Cursors.Hand;
button3.Text = "插入排序"; button3.Cursor = Cursors.Hand;
button4.Text = "快速(递归)"; button4.Cursor = Cursors.Hand;
button5.Text = "快速(非递归)"; button5.Cursor = Cursors.Hand;
panel1.Dock = DockStyle.Top;
panel2.Dock = DockStyle.Fill;
webBrowser1.Navigate("http://www.315soft.com");
}
private int[] RandArray()
{
int n = 20;
int[] dataArray = new int[n];
for (int i = 0; i < n; i++)
{
dataArray[i] = rnd.Next(20,100);
}
return dataArray;
}
private void button5_Click(object sender, EventArgs e)
{
QuickSort(RandArray());
loop = 0;
timer1.Interval = 100;
timer1.Enabled = true;
}
///
///快速排序（非递归）
///改编自：https://blog.csdn.net/syaguang2006/article/details/24441025
///
///
///
///
///
private void QuickSort(ref int[] dataArray, int Low, int High,Stack stack)
{
int low = Low;
int high = High;
int temp = dataArray[low];
while (high > low)
{
while (low < high&& temp <= dataArray[high])
{
high--;
}
if (high > low)
{
dataArray[low] =dataArray[high];
dataArray[high] = temp;
}
while (low < high &&temp >= dataArray[low])
{
low++;
}
if (high > low)
{
dataArray[high] =dataArray[low];
dataArray[low] = temp;
}
if (low == high)
{
if (Low < low - 1)
{
stack.Push(Low);
stack.Push(low - 1);
}
if (High > low + 1)
{
stack.Push(low + 1);
stack.Push(High);
}
}
}
}
private void QuickSort(ref int[] dataArray)
{
Stack s = new Stack();
s.Push(0);
s.Push(dataArray.Length - 1);
while (s.Count > 0)
{
int low = s.Pop();
int high = s.Pop();
if (low > high)
{
int temp = low;
low = high;
high = temp;
}
QuickSort(ref dataArray, low,high, s);
slides.Add(Slide(button5.Text,dataArray, low, high));
}
}
private string Slide(string title, int[] dataArray, int a, int b)
{
StringBuilder sb = new StringBuilder();
sb.AppendLine("");
sb.AppendLine("");
sb.AppendLine("");
sb.AppendLine("");
sb.AppendLine("td {vertical-align:bottom;text-align:center;font-size:12px; } ");
sb.AppendLine(".bar { width:" + (int)((webBrowser1.Width -dataArray.Length * 11) / dataArray.Length) + "px;font-size:12px;border:solid1px #FF6701;background-color:#F08080;text-align:center;border-radius:3px;}");
sb.AppendLine("");
sb.AppendLine("");
sb.AppendLine("");
sb.AppendLine("");
sb.AppendLine("");
sb.AppendLine("方法：" + title +
"</td>");
sb.AppendLine("数据：" +
dataArray.Length + "</td>");
sb.AppendLine("步骤：[0]</td>");
sb.AppendLine("");
sb.AppendLine("");
sb.AppendLine("
");
sb.AppendLine("");
sb.AppendLine("");
for (int i = 0; i < dataArray.Length; i++)
{
if (i == a || i == b)
{
sb.AppendLine("" + dataArray[i] + "");
}
else
{
sb.AppendLine("" + dataArray[i] + "");
}
}
sb.AppendLine("");
sb.AppendLine("");
sb.AppendLine("");
sb.AppendLine("");
return sb.ToString();
}
int loop = 0;
private void timer1_Tick(object sender, EventArgs e)
{
if (loop < slides.Count + (3000 / timer1.Interval))
{
if (loop < slides.Count)
{
webBrowser1.DocumentText =slides[loop].Replace("[0]", loop + " / " + slides.Count);
loop++;
return;
}
loop++;
return;
}
loop = 0;
}
}
}
