zoukankan      html  css  js  c++  java
  • 6.00 Introduction to Computer Science and Programming Lec 8: Efficiency and Order of Growth

    这个lec主要将复杂度的内容,这部分内容没有什么好总结的,不过里面那段Python代码比较有意思,就贴在这里吧

    import pylab, math
    
    def showGrowth(lower, upper):
        log = []
        linear = []
        quadratic = []
        logLinear = []
        exponential = []
        for n in range(lower, upper+1):
            log.append(math.log(n, 2))
            linear.append(n)
            logLinear.append(n*math.log(n, 2))
            quadratic.append(n**2)
            exponential.append(2**n)
        pylab.plot(log, label = 'log')
        pylab.plot(linear, label = 'linear')
        pylab.legend(loc = 'upper left')
        pylab.figure()
        pylab.plot(linear, label = 'linear')
        pylab.plot(logLinear, label = 'log linear')
        pylab.legend(loc = 'upper left')
        pylab.figure()
        pylab.plot(logLinear, label = 'log linear')
        pylab.plot(quadratic, label = 'quadratic')
        pylab.legend(loc = 'upper left')
        pylab.figure()
        pylab.plot(quadratic, label = 'quadratic')
        pylab.plot(exponential, label = 'exponential')
        pylab.legend(loc = 'upper left')
        pylab.figure()
        pylab.plot(quadratic, label = 'quadratic')
        pylab.plot(exponential, label = 'exponential')
        pylab.semilogy()
        pylab.legend(loc = 'upper left')
        return
    
    showGrowth(1, 1000)
    pylab.show()


  • 相关阅读:
    家庭问题(family)
    BFS简单题记
    【例2-3】围圈报数
    【例8.3】最少步数
    【例3-5】扩展二叉树
    股票买卖
    小球(drop)
    用循环单链表实现约瑟夫环
    二叉树的3种遍历6种实现
    const与#define宏常量 , inline与#define
  • 原文地址:https://www.cnblogs.com/jubincn/p/3381127.html
Copyright © 2011-2022 走看看