๐ป Informatika va dasturlash ยท Algoritmlar va murakkablik ยท โ โ โ
Quyidagi kodning vaqt murakkabligi qanday? for i in range(n): j = n while j > 1: j //= 2
- A)O(nยฒ)
- B)O(log n)
- C)O(n)
- D)O(n log n)
๐ To'g'ri javob va tushuntirishni ko'rish
โ D) O(n log n)
๐ก Tashqi sikl n marta, ichki sikl har safar log n marta bajariladi.