Ushbu algoritmning murakkabligi O(log N). for davri N marta ishlaydi, ya'ni for davri murakkabligi O((N). for davri ichida while davri log2(initial_len) ga teng bo'lgan miqdorda ishlaydi. Dastlab, initial_len lenN ga teng, shuning uchun while davri log2(((N)) ga teng. While davri har bir takrorlanishida j 2 ga ko'paytiriladi, ya'ni j j qiymatlarini 2, 4, 8, 16,..., jdan katta yoki unga teng bo'lguncha oladi.
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence