面向对象编程和渐近运行时
构建类层次结构的某些方法是否比其他方法更有效？有没有办法衡量这个？设计模式如何影响计算复杂性？我只是在想这个错误吗？只是好奇。
Are some ways of structuring a class hierarchy more efficient than others? Is there a way to measure this? How do design patterns factor in to computational complexity? Am I just thinking about this wrong? Just curious.
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（2）
面向对象编程与算法（以及渐近运行时）无关，它只是一种流行的构建程序的方式，试图使它们更加灵活并且更能抵抗变化。
设计模式也是如此。
Object-oriented programming has nothing to do with algorithms (and thus asymptotic runtime), it's just a popular way of structuring programs in an attempt to make them more flexible and resistant to change.
Same for design patterns.
如果不在面向对象代码中引入愚蠢的错误，任何算法的渐近复杂性都不会改变。特定算法的内存消耗/运行时间公式中的常数乘数可以改变，但它的渐近行为不会改变。但这种变化通常实际上并不重要。
If you don't introduce silly bugs in your OO code, asymptotic complexity of any algorithm won't change. Constant multiplier in formula for memory consumption/running time of your particular algorithm can change, but not it's asymptotic behavior. But this change , usually, is practically unimportant.