求一个算法（c#）

2个排好序的int型数组，合成一个新数组，并排序

---

貌似不需要算法，直接就有现成的函数。不确定，楼主查查吧。

---

C# code:
int[] i = new int[5] { 1, 2, 3, 4, 5 };
int[] j = new int[5] { 6, 7, 8, 9, 10 };
int[] m = new int[i.Length + j.Length];
j.CopyTo(m,0);
i.CopyTo(m, j.Length);

冒泡排序m

---

不用自己写，有现成的方法。

---

用个偷懒的方式
[code=C#]
int[] a = new int[] { 1,23,43,4};
int[] b = new int[]{3,34};
List <int> c = new List <int>();
c.AddRange(a);
c.AddRange(b);
c.Sort();
[code]

---

int[] numbers1=new int[10]{9,8,7,6,5,4,3,2,1,0};
int[] numbers2=new int[10]{11,19,12,18,13,17,14,16,15,10};

List <int> arrays=new List <int>();
arrays.AddRange(numbers1);
arrays.AddRange(numbers2);

arrays.Sort();//排序

int[] newNumbers=arrays.ToArray();

---

C# code:
int[] numbers1=new int[10]{9,8,7,6,5,4,3,2,1,0};
int[] numbers2=new int[10]{11,19,12,18,13,17,14,16,15,10};

List <int> arrays=new List <int>();
arrays.AddRange(numbers1);
arrays.AddRange(numbers2);

arrays.Sort();//排序

int[] newNumbers=arrays.