1.写出冒泡,选择,插入排序算法。 // 冒泡排序 public class bubblesorter ... { public void sort(int[] list) ...{ int i, j, temp; bool done = false; j = 1; while ((j < list.Length) && (!done)) ...{ done = true; for (i = 0; i < list.Length - j; i++) ...{ if (list[i] > list[i + 1]) ...{ done = false; temp = list[i]; list[i] = list[i + 1]; list[i + 1] = temp; } } j++; } } } // 选择排序 public class selectionsorter ... { private int min; public void sort(int[] list) ...{ for (int i = 0; i < list.Length - 1; i++) ...{ min = i; for (int j = i + 1; j < list.Length; j++)