T(n) = 4T(n/3) + n^2 takrorlanishi bilan tavsiflangan algoritmning murakkabligi Master teoremasidan foydalanib aniqlanishi mumkin. Master teoremasida T(n) = aT(n/b) + f(n) a >= 1 va b > 1 bo'lganda quyidagi uchta holatlar sodir bo'lishi mumkin: Agar f(n) = O(n^logb(a)) keyin T(n) = O(n^logb(a)) Agar f(n) = O(n^logb(a) * logn) keyin T(n) = O(n^logb(a) * logn) Agar f(n = O(n^logb(a) * logn) Agar f(n = O(n^logb(a)) va fn) O(n^log^log^n emas bo
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence