本文實例講述了C#實現(xiàn)的二維數(shù)組排序算法。分享給大家供大家參考，具體如下：
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
class Order{ /// <summary> /// 對二維數(shù)組排序 /// </summary> /// <param name="values">排序的二維數(shù)組</param> /// <param name="orderColumnsIndexs">排序根據(jù)的列的索引號數(shù)組</param> /// <param name="type">排序的類型，1代表降序，0代表升序</param> /// <returns>返回排序后的二維數(shù)組</returns> public static object[,] Orderby(object[,] values, int[] orderColumnsIndexs, int type) { object[] temp = new object[values.GetLength(1)]; int k; int compareResult; for (int i = 0; i < values.GetLength(0); i++) { for (k = i + 1; k < values.GetLength(0); k++) { if (type.Equals(1)) { for (int h = 0; h < orderColumnsIndexs.Length; h++) { compareResult = Comparer.Default.Compare(GetRowByID(values, k).GetValue(orderColumnsIndexs[h]), GetRowByID(values, i).GetValue(orderColumnsIndexs[h])); if (compareResult.Equals(1)) { temp = GetRowByID(values, i); Array.Copy(values, k * values.GetLength(1), values, i * values.GetLength(1), values.GetLength(1)); CopyToRow(values, k, temp); } if (compareResult != 0) break; } } else { for (int h = 0; h < orderColumnsIndexs.Length; h++) { compareResult = Comparer.Default.Compare(GetRowByID(values, k).GetValue(orderColumnsIndexs[h]), GetRowByID(values, i).GetValue(orderColumnsIndexs[h])); if (compareResult.Equals(-1)) { temp = GetRowByID(values, i); Array.Copy(values, k * values.GetLength(1), values, i * values.GetLength(1), values.GetLength(1)); CopyToRow(values, k, temp); } if (compareResult != 0) break; } } } } return values; } /// <summary> /// 獲取二維數(shù)組中一行的數(shù)據(jù) /// </summary> /// <param name="values">二維數(shù)據(jù)</param> /// <param name="rowID">行ID</param> /// <returns>返回一行的數(shù)據(jù)</returns> static object[] GetRowByID(object[,] values, int rowID) { if (rowID > (values.GetLength(0) - 1)) throw new Exception("rowID超出最大的行索引號!"); object[] row = new object[values.GetLength(1)]; for (int i = 0; i < values.GetLength(1); i++) { row[i] = values[rowID, i]; } return row; } /// <summary> /// 復制一行數(shù)據(jù)到二維數(shù)組指定的行上 /// </summary> /// <param name="values"></param> /// <param name="rowID"></param> /// <param name="row"></param> static void CopyToRow(object[,] values, int rowID, object[] row) { if (rowID > (values.GetLength(0) - 1)) throw new Exception("rowID超出最大的行索引號!"); if (row.Length > (values.GetLength(1))) throw new Exception("row行數(shù)據(jù)列數(shù)超過二維數(shù)組的列數(shù)!"); for (int i = 0; i < row.Length; i++) { values[rowID, i] = row[i]; } }}static void Main(string[] args){ object[,] o = new object[6, 4] { { 1, 2, 3, 4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 }, { 13, 14, 11, 12 }, { 15, 16, 11, 17, }, { 5, 6, 7,9 } }; Console.WriteLine("沒排序前的二維數(shù)組："); Print(o); Console.WriteLine("根據(jù)第3,4列升序排序后的數(shù)組："); Order.Orderby(o, new int[] { 2,3 },0); Print(o); Console.WriteLine("根據(jù)第3,4列降序序排序后的數(shù)組："); Order.Orderby(o, new int[] { 2, 3 }, 1); Print(o); Console.Read();}static void Print(object[,] values){ int k; for (int i = 0; i < values.GetLength(0);i++ ) { for (k = 0; k < values.GetLength(1);k++ ) { Console.Write(values[i,k]); Console.Write(" "); } Console.WriteLine(" "); }} |
運行結(jié)果：
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
沒排序前的二維數(shù)組：1 2 3 45 6 7 89 10 11 1213 14 11 1215 16 11 175 6 7 9根據(jù)第3,4列升序排序后的數(shù)組：1 2 3 45 6 7 85 6 7 913 14 11 129 10 11 1215 16 11 17根據(jù)第3,4列降序序排序后的數(shù)組：15 16 11 179 10 11 1213 14 11 125 6 7 95 6 7 81 2 3 4 |
希望本文所述對大家C#程序設計有所幫助。
原文鏈接：http://www.cnblogs.com/xuanfeng/archive/2008/11/20/1334636.html
