码迷,mamicode.com
首页 > 其他好文 > 详细

Time Complexity Big-O

时间:2015-05-01 07:08:22      阅读:225      评论: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
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!