Array.Copy 一種淺拷貝
int[] intArray = new int[5] { 1, 2, 3, 4, 5 };
Object[] objArray = new Object[5] {26,27,28,29,30 };
//Array.Copy(intArray, objArray, 2);//將intArray的前2個元素拷貝覆蓋到ObjArray的前兩個元素
Array.Copy(objArray, objArray.GetUpperBound(0) - 1, intArray, intArray.GetUpperBound (0)-1,2);//GetUpperBound (0)是取數組的一維大小
Array.Sort 快速排序機制,默認爲升序
int[] numbers = new int[10];
Random rnd = new Random();
for (int i = 0; i < 10; i++)
{
numbers[i] = rnd.Next(100);//我們用隨機數來增加練習的有趣性
}
Array.Sort(numbers);
假如需要得到的數組爲逆序的,添加如下代碼:
class IntComparer : IComparer<int>
{
#region IComparer<int> 成員
public int Compare(int x, int y)
{
if (_type == "DESC")
return y.CompareTo(x);//我們這裏正好讓它反過來,就實現了降序了
else
return x.CompareTo(y);
}
#endregion
private string _type = "ASC";
public IntComparer(string type)
{
_type = type;
}
}
調用:Array.Sort(intArray, new IntComparer("DESC"));