Tartibga solish algoritmlarining murakkabligi qanday?

Tartiblash algoritmlarining murakkabligi odatda vaqt va xotira bo'yicha baholanadi.

• Qobiq tartibi (Bubble Sort): vaqt — O(n²), xotira — O(1). Oddiy, ammo katta ma'lumotlar uchun samarali emas.
• Qo'shish tartibi (Insertion Sort): vaqt — O(n²) eng yomon holatda, O(n) eng yaxshi holatda (deyarli tartiblangan massiv), xotira — O(1).
• Qo'shilish tartibi (Merge Sort): vaqt — O(n log n) har holatda, xotira — O(n) qo'shimcha massiv sababli.
• Tez tartib (Quick Sort): o'rtacha vaqt — O(n log n), eng yomon — O(n²), xotira — O(log n) rekursiya sababli.
• Yuklama tartibi (Heap Sort): vaqt — O(n log n), xotira — O(1).

Java'da tez tartib misoli:

public static void quickSort(int[] arr, int low, int high) {
    if (low < high) {
        int pi = partition(arr, low, high);
        quickSort(arr, low, pi - 1);
        quickSort(arr, pi + 1, high);
    }
}

private static int partition(int[] arr, int low, int high) {
    int pivot = arr[high];
    int i = low - 1;
    for (int j = low; j < high; 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[high];
    arr[high] = temp;
    return i + 1;
}