排序算法
Kismy
I Can Do it !
展开
-
合并两个有序数组,并去重
void Start () { List<int> a = new List<int> { 1, 3,3, 5,6, 7 }; List<int> b = new List<int> { 2, 3,4, 6, 8 }; List<int> result = Merge(a, b); if (result != null) for (int i = 0; i &l...原创 2020-06-17 21:56:43 · 1579 阅读 · 0 评论 -
排序算法之1)直接插入排序
static void InsertSort(int[] dataArray) { for (int i = 1; i { int iValue = dataArray[i]; bool isInsert = false; /原创 2018-01-06 18:37:15 · 177 阅读 · 0 评论