T (n) = 4T (n/3) + n^2 takrorlanishi bilan tavsiflangan algoritmning murakkabligi O (n^2.376) ga teng. Bu T (n) = aT (n/b) + f (n) takrorlanish shaklini tan olib, ustun teoremasidan foydalanib hosil qilinadi, bu erda a=4, b=3, va f (n) = n^2.
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence