首页 > 其他 > 详细

Time Complexity Big-O

时间:2015-05-01 07:07:54      阅读:135      评论:0      收藏:0      [点我收藏+]

It can be inserted anywhere. Note that if you insert it in the beginning the TC will be O(#s +c), but it is also O(#s+ n). Remember that the TC is an Upper Bound. Make the program as fast as possible, provided it follows the specification. So in this case insert it at the beginning of the ULL.

Time Complexity Big-O

原文:http://www.cnblogs.com/miaoz/p/4470294.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!