recursive procedure

基本解释

According to activity-on-node disassembly tree, the recursive procedure of disassembly cost is set up.
根据结点式拆卸树，构建了拆卸成本的递推算法；
If you write a recursive procedure, you should test it very carefully to make sure it always meets some limiting condition.
在编写递归过程时，应非常细心地进行测试，以确保它总是能满足某些限制条件。
However, like the recursive procedure for computing Fibonacci numbers, this recursive solution requires multiple computations of the same subproblems.
但是，就像计算斐波纳契数的递归过程一样，这个递归解需要多次计算相同的子问题。