02Analysis算法设计.pptVIP

  • 2
  • 0
  • 约3.68千字
  • 约 63页
  • 2016-07-29 发布于重庆
  • 举报
02Analysis算法设计

Design and Analysis of Algorithms;2.1 Analysis;How To Measure the Running Time;How To Measure the Running Time;How To Measure the Running Time;A Famous Story ;Why It Matters;What It Matters;Polynomial and exponential (多项式和指数);数量级的差别;渐进表达式;2.2 Asymptotic Order of Growth (渐进分析);渐近分析的符号;f(n)=?(g(n));更多渐近分析的符号;在渐进分析中等于符号的滥用;在渐进分析中等于符号的滥用;渐近分析中函数比较;渐近分析记号的若干性质;(2)反身性: f(n)= ?(f(n)); f(n)= O(f(n)); f(n)= ?(f(n)). (3)对称性: f(n)= ?(g(n)) ? g(n)= ? (f(n)) . (4)互对称性: f(n)= O(g(n)) ? g(n)= ? (f(n)) ; f(n)= o(g(n)) ? g(n)= ? (f(n)) ;;(5)算术运算: O(f(n))+O(g(n)) = O(max{f(n),g(n)}) ; O(f(n))+O(g(n)) = O(f(n)+

文档评论(0)

1亿VIP精品文档

相关文档