当前位置：网站首页>The time complexity of two recursive entries in a recursive function

The time complexity of two recursive entries in a recursive function

2022-07-26 05:54:00 【Study and pursue high efficiency】

Insert picture description here example 7 Through calculation and analysis, it is found that the basic operation is recursive 2 Of n Power , The time complexity is O( 2 Of n Power ).（ It is suggested to draw a binary tree of recursive stack frames ）

The time complexity of recursion Calculation

First, the formula is Insert picture description here
In a function （ Above ）

In every recursion , The number of times executed has no loop , Namely 1

Then it depends on the number of recursion

The number of recursions , In fact, it's about logic , You can see that

Such as this logic
Fibonacci sequence recursive solution
The times are shown in the figure above

The total number of times is 2 Of N Power

版权声明
本文为[Study and pursue high efficiency]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/207/202207260553583863.html

边栏推荐

猜你喜欢