FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_02/id_121/NOTE.md at master · feixiangcode/algorithm · GitHub
feixiangcode
/
algorithm
Public
forked from
algorithm001/algorithm
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
algorithm
/
Week_02
/
id_121
/
NOTE.md
Copy path
More file actions
More file actions
Latest commit
History
History
History
4 lines (3 loc) · 378 Bytes
Breadcrumbs
algorithm
/
Week_02
/
id_121
/
NOTE.md
Copy path
File metadata and controls
4 lines (3 loc) · 378 Bytes
Raw
Copy raw file
Download raw file
Outline
Edit and raw actions
学习笔记
242
有时候单纯的看时间复杂度,并不能很好的度量一个算法的性能,尤其是在不同数据量的情况下,第一种方法时间复杂度是2n,第二种是3n,但是整体下来,第二种方法却更快一些,使用数组代替hashmap能够更快的随机访问以外,尽量少的使用对象包装器,也会提高性能
Back
|
FazBrowse Home
|
New Git URL