Differences between revisions 1 and 3 (spanning 2 versions)
Revision 1 as of 2021-07-03 05:50:44
Size: 107
Editor: zbjxb
Comment:
Revision 3 as of 2021-07-03 05:58:05
Size: 273
Editor: zbjxb
Comment:
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
* 堆栈(包括递归依赖的系统堆栈)用来实现深度优先
* 队列用来实现广度优先
 *堆栈(包括递归依赖的系统堆栈)用来实现深度优先
 *队列用来实现广度优先
 *算法时间复杂度分析,关键在于两个工具:加法规则、乘法规则。就是概率统计里的那两个规则。乘法规则针对循环嵌套。
  • 堆栈(包括递归依赖的系统堆栈)用来实现深度优先
  • 队列用来实现广度优先
  • 算法时间复杂度分析,关键在于两个工具:加法规则、乘法规则。就是概率统计里的那两个规则。乘法规则针对循环嵌套。

datastructure_and_algorithms (last edited 2021-07-03 12:22:18 by zbjxb)