sjs/samhuri.net
1
0
Fork 0
mirror of https://github.com/samsonjs/samhuri.net.git synced 2026-03-25 09:05:47 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

update

Browse source
This commit is contained in:
Sami Samhuri 2016-08-10 11:26:11 -07:00
parent 50ed93f967
commit 816b35fa1c
1 changed files with 1 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
public/posts/2016/08/easy-optimization-wins.md
View file

@ -42,6 +42,6 @@ The for loops are still `O(n)` and now we've shifted some work outside of those
Putting the constant back in let's see how many operations it now takes to get an array of all videos sorted by date. Again saying we have a modest collection of 1,000 videos, that'll be `2 * 1,000 * log 1000` → `2,000 * 3` → `6,000` operations to do the whole thing. A far cry from 1,000,000!
Getting practical, in this case running the original function against **4,990 videos takes 29.653 seconds** on an iPhone 4S. Running the new function against the same set of videos takes **58 milliseconds or 0.058 seconds**.
Getting practical, in this case running the original function against **4,990 videos takes 29.653 seconds** on an iPhone 4S. Running the new function against the same set of videos takes **4.792 seconds**. Still not great and there's room for improvement, but that was a big, easy win already.
Mind your algorithms folks, it makes a huge difference in the real world.