Algorithms/go-perfbook
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update performance.md

Browse Source
This commit is contained in:
Raymond Rutjes 2018-04-24 22:48:48 +02:00 committed by GitHub
parent 0bd1f2a8cf
commit abc920be27
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
performance.md
View File

@ -67,7 +67,7 @@ about 97% of the time: premature optimization is the root of all evil. Yet we
should not pass up our opportunities in that critical 3%." -- Knuth
Add: https://www.youtube.com/watch?time_continue=429&v=RT46MpK39rQ
* don't ignore the the easy optimizations
* don't ignore the easy optimizations
* more knowledge of algorithms and data structures makes more optimizations "easy" or "obvious"
"Should you optimize? "Yes, but only if the problem is important, the program
@ -220,7 +220,7 @@ speeding up routine that takes 80% of the time by only 10% will improve runtime
by almost 8%. Profiles will help identify where time is actually spent.
When optimizing, you want to reduce the amount of work the CPU has to do.
Quicksort is faster than bubble sort because it solves then same problem
Quicksort is faster than bubble sort because it solves the same problem
(sorting) in fewer steps. It's a more efficient algorithm. You've reduced the
work the CPU needs to do in order to accomplish the same task.