数据结构(C#)_排序算法(冒泡排序)
春节前后由于忙着公司里的项目,所以复习数据结构的学习计划被打乱了,前两天新的项目上线了,周末可以偷空继续看了,这个系列我希望一直可以坚持下去。之前很多朋友问我要电子版的书,我有给部分朋友发到邮箱去,但是由于忙,有的朋友我就没有发,请大家见谅。我本来打算直接在博客园上提供下载,但是每次上载的时候都会提示有脚本错误,不知道是为什么,这个还要麻烦DUDU看一下是什么问题。我现在已经将文件放到了一个文件共享的服务器上了,大家可以按照以下这个地址下载。
http://oyjd614.uubox.net/self.u/%E7%94%B5%E5%AD%90%E4%B9%A6/Data.Structures.and.Algorithms.pdf/
由于这本书我发现的错误较多,感觉质量不是很好,所以大家在看的时候一定要注意。好了,我们继续这个系列,今天主要是将排序算法中最简单的冒泡排序。所谓冒泡排序就是在每一次排序的过程中总有一个最大的值被移动到后面,值小的就像水泡一样浮到水面。下面我们就看一下代码,重要的地方都有注释,大家可以看注释。
http://oyjd614.uubox.net/self.u/%E7%94%B5%E5%AD%90%E4%B9%A6/Data.Structures.and.Algorithms.pdf/
由于这本书我发现的错误较多,感觉质量不是很好,所以大家在看的时候一定要注意。好了,我们继续这个系列,今天主要是将排序算法中最简单的冒泡排序。所谓冒泡排序就是在每一次排序的过程中总有一个最大的值被移动到后面,值小的就像水泡一样浮到水面。下面我们就看一下代码,重要的地方都有注释,大家可以看注释。
1
class SortingAlgorithms
2
{
3
private int[] arr;
4
private int upper;
5
private int numElement;
6![](/Images/OutliningIndicators/InBlock.gif)
7
//初始化数组
8
public SortingAlgorithms(int size)
9
{
10
arr = new int[size];
11
upper = size - 1;
12
numElement = 0;
13
}
14![](/Images/OutliningIndicators/InBlock.gif)
15
//给数组插入元素
16
public void Insert(int item)
17
{
18
arr[numElement] = item;
19
numElement++;
20
}
21![](/Images/OutliningIndicators/InBlock.gif)
22
//打印数组元素
23
public void DisplayElement()
24
{
25
for (int i = 0; i <= upper; i++)
26
{
27
Console.WriteLine(arr[i] + " ");
28
}
29
Console.ReadLine();
30
}
31![](/Images/OutliningIndicators/InBlock.gif)
32![](/Images/OutliningIndicators/InBlock.gif)
33
//冒泡排序
34
public void BubbleSort()
35
{
36
int Temp;
37
//外循环是限制一次冒泡排序比较的元素个数
38
for (int Outer = upper; Outer >= 1; Outer--)
39
{
40
//一次冒泡排序比较0~ourter-1个元素的大小
41
for (int Inner = 0; Inner <= Outer-1; Inner++)
42
{
43
//排序过程
44
if (arr[Inner] > arr[Inner + 1])
45
{
46
Temp = arr[Inner];
47
arr[Inner] = arr[Inner + 1];
48
arr[Inner + 1] = Temp;
49
}
50
}
51
}
52
//this.DisplayElement();
53
}
54![](/Images/OutliningIndicators/InBlock.gif)
55
}
56![](/Images/OutliningIndicators/None.gif)
57
一下是调用算法的过程:
58
static void Main(string[] args)
59
{
60
SortingAlgorithms MyArray = new SortingAlgorithms(10);
61
Random rnd = new Random(100);
62
for (int i = 0; i < 10; i++)
63
{
64
MyArray.Insert((int)(rnd.NextDouble()*100));
65
}
66
Console.WriteLine("Before Sorting:");
67
MyArray.DisplayElement();
68
//进行排序
69
MyArray.BubbleSort();
70
Console.WriteLine("After sorting");
71
//打印排序后的元素
72
MyArray.DisplayElement();
73
}
![](/Images/OutliningIndicators/None.gif)
2
![](/Images/OutliningIndicators/ExpandedBlockStart.gif)
3
![](/Images/OutliningIndicators/InBlock.gif)
4
![](/Images/OutliningIndicators/InBlock.gif)
5
![](/Images/OutliningIndicators/InBlock.gif)
6
![](/Images/OutliningIndicators/InBlock.gif)
7
![](/Images/OutliningIndicators/InBlock.gif)
8
![](/Images/OutliningIndicators/InBlock.gif)
9
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
10
![](/Images/OutliningIndicators/InBlock.gif)
11
![](/Images/OutliningIndicators/InBlock.gif)
12
![](/Images/OutliningIndicators/InBlock.gif)
13
![](/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
14
![](/Images/OutliningIndicators/InBlock.gif)
15
![](/Images/OutliningIndicators/InBlock.gif)
16
![](/Images/OutliningIndicators/InBlock.gif)
17
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
18
![](/Images/OutliningIndicators/InBlock.gif)
19
![](/Images/OutliningIndicators/InBlock.gif)
20
![](/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
21
![](/Images/OutliningIndicators/InBlock.gif)
22
![](/Images/OutliningIndicators/InBlock.gif)
23
![](/Images/OutliningIndicators/InBlock.gif)
24
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
25
![](/Images/OutliningIndicators/InBlock.gif)
26
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
27
![](/Images/OutliningIndicators/InBlock.gif)
28
![](/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
29
![](/Images/OutliningIndicators/InBlock.gif)
30
![](/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
31
![](/Images/OutliningIndicators/InBlock.gif)
32
![](/Images/OutliningIndicators/InBlock.gif)
33
![](/Images/OutliningIndicators/InBlock.gif)
34
![](/Images/OutliningIndicators/InBlock.gif)
35
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
36
![](/Images/OutliningIndicators/InBlock.gif)
37
![](/Images/OutliningIndicators/InBlock.gif)
38
![](/Images/OutliningIndicators/InBlock.gif)
39
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
40
![](/Images/OutliningIndicators/InBlock.gif)
41
![](/Images/OutliningIndicators/InBlock.gif)
42
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
43
![](/Images/OutliningIndicators/InBlock.gif)
44
![](/Images/OutliningIndicators/InBlock.gif)
45
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
46
![](/Images/OutliningIndicators/InBlock.gif)
47
![](/Images/OutliningIndicators/InBlock.gif)
48
![](/Images/OutliningIndicators/InBlock.gif)
49
![](/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
50
![](/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
51
![](/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
52
![](/Images/OutliningIndicators/InBlock.gif)
53
![](/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
54
![](/Images/OutliningIndicators/InBlock.gif)
55
![](/Images/OutliningIndicators/ExpandedBlockEnd.gif)
56
![](/Images/OutliningIndicators/None.gif)
57
![](/Images/OutliningIndicators/None.gif)
58
![](/Images/OutliningIndicators/None.gif)
59
![](/Images/OutliningIndicators/ExpandedBlockStart.gif)
60
![](/Images/OutliningIndicators/InBlock.gif)
61
![](/Images/OutliningIndicators/InBlock.gif)
62
![](/Images/OutliningIndicators/InBlock.gif)
63
![](/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
64
![](/Images/OutliningIndicators/InBlock.gif)
65
![](/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
66
![](/Images/OutliningIndicators/InBlock.gif)
67
![](/Images/OutliningIndicators/InBlock.gif)
68
![](/Images/OutliningIndicators/InBlock.gif)
69
![](/Images/OutliningIndicators/InBlock.gif)
70
![](/Images/OutliningIndicators/InBlock.gif)
71
![](/Images/OutliningIndicators/InBlock.gif)
72
![](/Images/OutliningIndicators/InBlock.gif)
73
![](/Images/OutliningIndicators/ExpandedBlockEnd.gif)