### Question:
Sort { public static void maopaoSort(int[] data) { int len = data.length; for (int i = 0; i < len - 2; i++) { for (int j = 0; j < len - i - 1; j++) { if (data[j] < data[j + 1]) { int temp = data[j]; data[j] = data[j + 1]; data[j + 1] = temp; } } } }  static void maopaoSort(int[] data); static void quickSort(int[] data); static void insertSort(int[] data); static void selectSort(int[] data); static void quickSort(int[] data, int left, int right); static void quickSort2(int[] arr, int l, int r); static void heapSort(int[] arr, int node); static void buildHeap(int[] arr, int length); static void adjustHeap(int[] arr, int index, int length); static void swap(int[] arr, int a_index, int b_index);  }### Answer:
@Test public void testMaopao() { int[] data = {1, 4, 5, 3, 2}; Sort.maopaoSort(data); for (int i : data) { System.out.println(i); } }