qq_38782818的博客

public void CountingSort(ref int[] list, int min = 0, int max = 0) { if(min == 0 && max == 0) { for (int i = 0; i < list.Length; ++i) { if (list[i] < min) .

public int[] InsertSortGap(int[] list, int gap) { int m_lenth = list.Length; int m_sortNum; for (int i = gap; i < m_lenth; i += gap)//每次取一个数，gap：希尔排序分段 { for (int s = i - gap; s &..

public int Partition(int[] list, int pFirst =0, int pLast=0) { int m_length = list.Length; int m_midNum = 0; int p1 = pFirst; int p2; if(pLast != 0) { ...

public int[] InsertSort(int[] list) { int m_lenth = list.Length; int m_sortNum; for(int i = 1; i < m_lenth; i++)//每次取一个数 { for(int s = i - 1; s >= 0 ; s--)//插入有序区 .

public int[] SelectSort (int[] list) { int m_min = 0; int m_minNum = 0; int m_lenth = list.Length; for (int i = 0; i < m_lenth; i++)//趟 { fo.

public int[] BubbleSort(int[] list) { int m_lenth = list.Length; int m_sortedNum; int m_perfectNum = 0; for (int m_chaosList = m_lenth; m_chaosList > 1; m_chaosList--)//趟,每一趟m_chaosList无序区都少一个数 ...