产生100个随机数并使用冒泡排序和选择排序对这些数进行排序java
时间: 2023-05-27 08:07:21 浏览: 51
冒泡排序:
```
import java.util.Arrays;
import java.util.Random;
public class BubbleSort {
public static void main(String[] args) {
int[] arr = generateRandomArray(100);
System.out.println("Before sorting: " + Arrays.toString(arr));
bubbleSort(arr);
System.out.println("After sorting: " + Arrays.toString(arr));
}
public static void bubbleSort(int[] arr) {
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
public static int[] generateRandomArray(int size) {
int[] arr = new int[size];
Random random = new Random();
for (int i = 0; i < size; i++) {
arr[i] = random.nextInt(1000);
}
return arr;
}
}
```
选择排序:
```
import java.util.Arrays;
import java.util.Random;
public class SelectionSort {
public static void main(String[] args) {
int[] arr = generateRandomArray(100);
System.out.println("Before sorting: " + Arrays.toString(arr));
selectionSort(arr);
System.out.println("After sorting: " + Arrays.toString(arr));
}
public static void selectionSort(int[] arr) {
for (int i = 0; i < arr.length - 1; i++) {
int minIndex = i;
for (int j = i + 1; j < arr.length; j++) {
if (arr[j] < arr[minIndex]) {
minIndex = j;
}
}
int temp = arr[i];
arr[i] = arr[minIndex];
arr[minIndex] = temp;
}
}
public static int[] generateRandomArray(int size) {
int[] arr = new int[size];
Random random = new Random();
for (int i = 0; i < size; i++) {
arr[i] = random.nextInt(1000);
}
return arr;
}
}
```