T(n) = 4T(n/3) + n^2 takrorlanishi bilan tavsiflangan algoritmning vaqt murakkabligi O(n^3) ga teng. Buni aniqlash uchun biz Master teoremasidan foydalanishimiz mumkin, u agar takrorlanish aloqasi T(n) = aT(n/b) + f(n shaklida bo'lsa, vaqt murakkabligi quyidagi holatlar bilan berilgan: Agar f(n) = O(n^logb_a), keyin T(n) = O(n^logb_a). Agar f(n) = Θ^logb_a * log n), keyin T(n) = Θ^logb_a * log n). Agar f(n = Ω^logb_a) va a > b^c (c > 0), keyin T) = Θ^logb_a). Ushbu holatda bizda a = b = 4, va
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence