How to calculate the time complexity of for (i = n; i> = 1; i / = 2)?

前端 未结 0 944
我在风中等你
我在风中等你 2020-12-21 06:25

The exercise asks me for temporal complexity and I don\'t know if it\'s notation O, and i thin is o(log2) help ps

相关标签:
回答
  • 消灭零回复
提交回复
热议问题