zoukankan
html css js c++ java
不同时间复杂度的规模上限
重要的事实:
当代计算机1s内可做10^7左右次计算 配置好的机器可到k*10^7~10^8
复杂度
数量级
最大规模
O(logN)
>>10^20
很大
O(N^1/2)
10^12
10^14
O(N)
10^6
10^7
O(NlogN)
10^5
10^6
O(N^2)
1000
2500
O(N^3)
100
500
O(N^4)
50
50
O(2^N)
20
20
O(N!)
9
10
查看全文
相关阅读:
RH133读书 笔记(3)
RH033读书笔记(16)-Lab 17 Installation and Administration Tools
RH033读书笔记(15)-Lab 16 The Linux Filesystem
RH033读书笔记(14)-Lab 15 Switching Users and Setting a Umask
RH033读书笔记(13)-Lab 14 Network Clients
RH033读书笔记(12)-Lab 13 Finding and Processing Files
RH033读书笔记(11)-Lab 12 Configuring the bash Shell
RH033读书笔记(10)-Lab 11 Process Control
RH033读书笔记(9)-Lab 10 Understanding the Configuration Tools
RH033读书笔记(8)-Lab 9 Using vim
原文地址:https://www.cnblogs.com/flipped/p/5188512.html
最新文章
验证手机格式的js代码
myeclipse6.6+maven跑springside4.1的demo
如何在windows下的Python开发工具IDLE里安装其他模块?
RH253读书笔记(5)-Lab 5 Network File Sharing Services
myeclipse的debug模式中breakpoint窗口怎么调出来
Legal or Not HDU
MySQL常用时间函数
RH253读书笔记(4)-Lab 4 The Domain Name System
RH253读书笔记(3)-Lab 3 Securing Networking
RH253读书笔记(2)-Lab 2 System Resource Access Controls
热门文章
RH253读书笔记(1)-Lab 1 System Monitoring
jQuery 复合选择器的几个例子
RH133读书笔记(11)-Lab 11 System Rescue and Troubleshooting
RH133读书笔记(10)-Lab 10 Exploring Virtualization
RH133读书笔记(9)-Lab 9 Installation and System-Initialization
RH133读书笔记(8)-Lab 8 Manage Network Settings
RH133读书笔记(7)-Lab 7 Advanced Filesystem Mangement
RH133读书笔记(6)
RH133读书 笔记(5)
RH133读书 笔记(4)
Copyright © 2011-2022 走看看