数据结构与算法复杂度、Big-O notation
source link: https://chegva.com/4687.html
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
CHEGVA
让我们面对现实 让我们忠于理想
☰ 分类目录
✎ 近期文章
♚ 大家正在看
☘ 随机文章
☯ 传统文化
☺ 近期评论
⌚ 博客统计
♡ 友情链接
数据结构与算法复杂度、Big-O notation
-- What is Big O? --
O(1): Constant Complexity: Constant 常数复杂度
O(log n): Logarithmic Complexity: 对数复杂度
O(n): Linear Complexity: 线性时间复杂度
O(n^2): N square Complexity 平⽅
O(n^3): N square Complexity ⽴⽅
O(2^n): Exponential Growth 指数
O(n!): Factorial 阶乘
Common Data Structure Operations
Array Sorting Algorithms
◎ big-o-cheatsheet.pdf ,来源:https://www.bigocheatsheet.com/
您可能还感兴趣的文章!
发表评论 取消回复
电子邮件地址不会被公开。 必填项已用*标注
评论
姓名 *
电子邮件 *
站点
Save my name, email, and website in this browser for the next time I comment.
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK