冒泡排序与快速排序（Java）

柔情只为你懂 2022-05-25 21:28 212阅读 0赞

package exercise;  
  
  
public class Abstract \{  
public static int getMiddle(int\[\] numbers, int low, int high) \{  
int temp = numbers\[low\]; // 数组的第一个作为基准点  
while (low < high) \{  
if (low < high && numbers\[high\] > temp) \{  
high--;  
\}  
numbers\[low\] = numbers\[high\];// 比基准点小的记录移到低端  
if (low < high && numbers\[low\] < temp) \{  
low++;  
\}  
numbers\[high\] = numbers\[low\]; // 比基准点大的记录移到高端  
\}  
numbers\[low\] = temp; // 基准点记录到尾  
return low; // 返回基准点的位置  
\}  
  
  
public static void quickSort(int\[\] numbers, int low, int high) \{  
if (low < high) \{  
int middle = getMiddle(numbers, low, high); // 将numbers数组进行一分为二  
quickSort(numbers, low, middle - 1); // 对低字段表进行递归排序  
quickSort(numbers, middle + 1, high); // 对高字段表进行递归排序  
\}  
\}  
  
  
public static void quick(int\[\] numbers) \{  
if (numbers.length > 0) // 查看数组是否为空  
\{  
quickSort(numbers, 0, numbers.length - 1);  
\}  
\}  
  
  
public static void printArr(int\[\] numbers) \{  
for (int i = 0; i < numbers.length; i++) \{  
System.out.print(numbers\[i\] + ",");  
\}  
System.out.println("");  
\}  
  
  
public static void main(String\[\] args) \{  
int\[\] numbers = \{ 1, 2, 15, 0, 6, 7, 22, 31, -5, 55 \};  
System.out.print("排序前：");  
printArr(numbers);  
bubbleSort(numbers);  
System.out.print("冒泡排序后：");  
printArr(numbers);  
quick(numbers);  
System.out.print("快速排序后：");  
printArr(numbers);  
\}  
  
  
private static void bubbleSort(int\[\] numbers) \{  
int temp = 0;  
int size = numbers.length;  
for (int i = 0; i < size - 1; i++) \{  
for (int j = 0; j < size - 1 - i; j++) \{  
if (numbers\[j\] > numbers\[j + 1\]) \{  
temp = numbers\[j\];  
numbers\[j\] = numbers\[j + 1\];  
numbers\[j + 1\] = temp;  
  
  
\}  
\}  
\}  
\}

![70][]

[70]: /images/20220526/2e96d3809818453cae078fb83fc86035.png