Java语言的经典小算法

冒泡排序 | 二分查找 | 快速排序

1 冒泡排序

public static void bubbleSort(int[] arr) {  
    int n = arr.length;  
    for (int i = 0; i < n - 1; i++) {  
        for (int j = 0; j < n - i - 1; j++) {  
            if (arr[j] > arr[j + 1]) {  
                int temp = arr[j];  
                arr[j] = arr[j + 1];  
                arr[j + 1] = temp;  
            }  
        }  
    }  
}

2 二分查找

public static int binarySearch(int[] arr, int target) {  
    int left = 0;  
    int right = arr.length - 1;  
    while (left <= right) {  
        int mid = (left + right) / 2;  
        if (arr[mid] == target) {  
            return mid;  
        } else if (arr[mid] < target) {  
            left = mid + 1;  
        } else {  
            right = mid - 1;  
        }  
    }  
    return -1; // 没有找到目标元素  
}

3 快速排序

public static void quickSort(int[] arr, int left, int right) {  
    if (left < right) {  
        int pivotIndex = partition(arr, left, right);  
        quickSort(arr, left, pivotIndex - 1);  
        quickSort(arr, pivotIndex + 1, right);  
    }  
}  
  
private static int partition(int[] arr, int left, int right) {  
    int pivot = arr[right]; // 选择最右边的元素作为枢轴  
    int i = left - 1; // i指向小于等于枢轴的子数组的最后一个元素  
    for (int j = left; j < right; j++) {  
        if (arr[j] <= pivot) {  
            i++;  
            int temp = arr[i];  
            arr[i] = arr[j];  
            arr[j] = temp;  
        }  
    }  
    int temp = arr[i + 1];  
    arr[i + 1] = arr[right];  
    arr[right] = temp;  
    return i + 1; // 返回枢轴的位置  
}