zoukankan
html css js c++ java
C#排序算法大全
C#排序算法大全
土人
2004
-
7
-
21
一、冒泡排序(Bubble)
using
System;
namespace
BubbleSorter
{
public
class
BubbleSorter
{
public
void
Sort(
int
[] list)
{
int
i,j,temp;
bool
done
=
false
;
j
=
1
;
while
((j
<
list.Length)
&&
(
!
done))
{
done
=
true
;
for
(i
=
0
;i
<
list.Length
-
j;i
++
)
{
if
(list[i]
>
list[i
+
1
])
{
done
=
false
;
temp
=
list[i];
list[i]
=
list[i
+
1
];
list[i
+
1
]
=
temp;
}
}
j
++
;
}
}
}
public
class
MainClass
{
public
static
void
Main()
{
int
[] iArrary
=
new
int
[]
{
1
,
5
,
13
,
6
,
10
,
55
,
99
,
2
,
87
,
12
,
34
,
75
,
33
,
47
}
;
BubbleSorter sh
=
new
BubbleSorter();
sh.Sort(iArrary);
for
(
int
m
=
0
;m
<
iArrary.Length;m
++
)
Console.Write(
"
{0}
"
,iArrary[m]);
Console.WriteLine();
}
}
}
二、选择排序(Selection)
using
System;
namespace
SelectionSorter
{
public
class
SelectionSorter
{
private
int
min;
public
void
Sort(
int
[] list)
{
for
(
int
i
=
0
;i
<
list.Length
-
1
;i
++
)
{
min
=
i;
for
(
int
j
=
i
+
1
;j
<
list.Length;j
++
)
{
if
(list[j]
<
list[min])
min
=
j;
}
int
t
=
list[min];
list[min]
=
list[i];
list[i]
=
t;
}
}
}
public
class
MainClass
{
public
static
void
Main()
{
int
[] iArrary
=
new
int
[]
{
1
,
5
,
3
,
6
,
10
,
55
,
9
,
2
,
87
,
12
,
34
,
75
,
33
,
47
}
;
SelectionSorter ss
=
new
SelectionSorter();
ss.Sort(iArrary);
for
(
int
m
=
0
;m
<
iArrary.Length;m
++
)
Console.Write(
"
{0}
"
,iArrary[m]);
Console.WriteLine();
}
}
}
三、插入排序(InsertionSorter)
using
System;
namespace
InsertionSorter
{
public
class
InsertionSorter
{
public
void
Sort(
int
[] list)
{
for
(
int
i
=
1
;i
<
list.Length;i
++
)
{
int
t
=
list[i];
int
j
=
i;
while
((j
>
0
)
&&
(list[j
-
1
]
>
t))
{
list[j]
=
list[j
-
1
];
--
j;
}
list[j]
=
t;
}
}
}
public
class
MainClass
{
public
static
void
Main()
{
int
[] iArrary
=
new
int
[]
{
1
,
13
,
3
,
6
,
10
,
55
,
98
,
2
,
87
,
12
,
34
,
75
,
33
,
47
}
;
InsertionSorter ii
=
new
InsertionSorter();
ii.Sort(iArrary);
for
(
int
m
=
0
;m
<
iArrary.Length;m
++
)
Console.Write(
"
{0}
"
,iArrary[m]);
Console.WriteLine();
}
}
}
四、希尔排序(ShellSorter)
using
System;
namespace
ShellSorter
{
public
class
ShellSorter
{
public
void
Sort(
int
[] list)
{
int
inc;
for
(inc
=
1
;inc
<=
list.Length
/
9
;inc
=
3
*
inc
+
1
);
for
(;inc
>
0
;inc
/=
3
)
{
for
(
int
i
=
inc
+
1
;i
<=
list.Length;i
+=
inc)
{
int
t
=
list[i
-
1
];
int
j
=
i;
while
((j
>
inc)
&&
(list[j
-
inc
-
1
]
>
t))
{
list[j
-
1
]
=
list[j
-
inc
-
1
];
j
-=
inc;
}
list[j
-
1
]
=
t;
}
}
}
}
public
class
MainClass
{
public
static
void
Main()
{
int
[] iArrary
=
new
int
[]
{
1
,
5
,
13
,
6
,
10
,
55
,
99
,
2
,
87
,
12
,
34
,
75
,
33
,
47
}
;
ShellSorter sh
=
new
ShellSorter();
sh.Sort(iArrary);
for
(
int
m
=
0
;m
<
iArrary.Length;m
++
)
Console.Write(
"
{0}
"
,iArrary[m]);
Console.WriteLine();
}
}
}
白虎
Hello! I Am David.DU.
查看全文
相关阅读:
C++Josephus问题
C++背包示例
C++1000以内的质数
as3+asp+access编码
fb设置flashplayer
三视图示例
正确实现 IDisposable 接口
.net垃圾回收和CLR 4.0对垃圾回收所做的改进之二
.net垃圾回收和CLR 4.0对垃圾回收所做的改进之三
CLR 全面透彻解析:大型对象堆揭秘
原文地址:https://www.cnblogs.com/whitetiger/p/1278468.html
最新文章
Binary Tree Level Order Traversal II
putty配置导出
Convert Sorted Array to Binary Search Tree
图片垂直剧中
是否存在SQL敏感字符
页面类
常用正则
对联广告
工具类
清除浮动
热门文章
中文生成拼音
多选
层首屏居中
C++遍历树递归
C++使用分治法找最大值
C++层次遍历
C++链表插入排序例子
C++链表逆转操作
C++链表首尾节点的常规方案
C++遍历树非递归递归使用了标记位
Copyright © 2011-2022 走看看