以下是使用SpringBoot实现一些常见的排序算法的示例代码:
- 冒泡排序
@RestController
public class BubbleSortController {
@GetMapping("/bubbleSort")
public int[] bubbleSort() {
int[] arr = { 5, 7, 3, 2, 8, 6, 4, 1, 9 };
int temp;
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
temp = arr[j + 1];
arr[j + 1] = arr[j];
arr[j] = temp;
}
}
}
return arr;
}
}
2.快速排序
@RestController
public class QuickSortController {
@GetMapping("/quickSort")
public int[] quickSort() {
int[] arr = { 5, 7, 3, 2, 8, 6, 4, 1, 9 };
quickSort(arr, 0, arr.length - 1);
return arr;
}
private void quickSort(int[] arr, int left, int right) {
if (left < right) {
int partitionIndex = partition(arr, left, right);
quickSort(arr, left, partitionIndex - 1);
quickSort(arr, partitionIndex + 1, right);
}
}
private int partition(int[] arr, int left, int right) {
int pivot = left;
int index = pivot + 1;
for (int i = index; i <= right; i++) {
if (arr[i] < arr[pivot]) {
swap(arr, i, index);
index++;
}
}
swap(arr, pivot, index - 1);
return index - 1;
}
private void swap(int[] arr, int i, int j) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
3.插入排序
@RestController
public class InsertionSortController {
@GetMapping("/insertionSort")
public int[] insertionSort() {
int[] arr = { 5, 7, 3, 2, 8, 6, 4, 1, 9 };
int temp, j;
for (int i = 1; i < arr.length; i++) {
temp = arr[i];
j = i - 1;
while (j >= 0 && arr[j] > temp) {
arr[j + 1] = arr[j];
j--;
}
arr[j + 1] = temp;
}
return arr;
}
}
4.归并排序
@RestController
public class MergeSortController {
@GetMapping("/mergeSort")
public int[] mergeSort() {
int[] arr = { 5, 7, 3, 2, 8, 6, 4, 1, 9 };
mergeSort(arr, 0, arr.length - 1);
return arr;
}
private void mergeSort(int[] arr, int left, int right) {
if (left < right) {
int mid = (left + right) / 2;
mergeSort(arr, left, mid);
mergeSort(arr, mid + 1, right);
merge(arr, left, mid, right);
}
}
private void merge(int[] arr, int left, int mid, int right) {
int[] temp = new int[arr.length];
int i = left, j = mid + 1, t = 0;
while (i <= mid && j <= right) {
if (arr[i] <= arr[j]) {
temp[t++] = arr[i++];
} else {
temp[t++] = arr[j++];
}
}
while (i <= mid) {
temp[t++] = arr[i++];
}
while (j <= right) {
temp[t++] = arr[j++];
}
t = 0;
while (left <= right) {
arr[left++] = temp[t++];
}
}
}
请注意,在实际使用时,这些算法需要进行更多的测试和优化,以确保它们的效率和正确性。