山坡上的蒲公英

摘要： public int[] Quick_Sort(int[] data, int low, int high){ int m = QuickSort(data, 0, 7);QuickSort(data, 0, m);QuickSort(data, m + 1, 7); return data;}//快排序public int QuickSort(int[] data, int low, int high){ if (low < high){ int i; int j;i = low; j = high; int temp; int key = data[i]... 阅读全文

摘要： //直接选择排序public int[] SelectSort(int[] data){ int temp1; int temp2; for (int i = 0; i < data.Length; i++){ for (int j = i; j < data.Length-1; j++){ if (data[j] < data[j + 1]){ temp1 = data[j]; data[j] = data[j + 1]; data[j + 1] = temp1;} }temp2 = data[i];data[i] = data[data.Length-1];d... 阅读全文

摘要： //直接插入排序法public int[] DirectSort(int[] data){ int temp; int x; for (int i = 0; i < data.Length; i++){ x = data[i]; for (int j = i - 1; j >= 0; j--){ if (x < data[j]){ temp = data[j + 1];data[j + 1] = data[j];data[j] = temp;}} } return data;} 阅读全文

摘要： //冒泡排序法public int[] BobbleSort(int[] data){ int temp;for (int i = 0; i < data.Length; i++){ for (int j = data.Length - 1; j > i; j--){ if (data[j] < data[j - 1]) { temp = data[j]; data[j] = data[j - 1]; data[j - 1] = temp; } } }return data;} 阅读全文

摘要： public class LinkNode //链表结点{ publicint data;publicLinkNode next;}//头插法publicLinkNode Create(int[] data){ LinkNode Head = newLinkNode(); Head.next = null; for (int i = 0; i < data.Length; i++) { LinkNode s = newLinkNode();s.data = data[i];s.next = Head.next;Head.next = s; } return Head;}//尾插... 阅读全文