summaryrefslogtreecommitdiff
path: root/blog/2021-08-18.md
diff options
context:
space:
mode:
Diffstat (limited to 'blog/2021-08-18.md')
-rw-r--r--blog/2021-08-18.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/blog/2021-08-18.md b/blog/2021-08-18.md
index 6655824..f048106 100644
--- a/blog/2021-08-18.md
+++ b/blog/2021-08-18.md
@@ -68,7 +68,7 @@ Which will produce a nice output in less then **0.03** seconds:
Notice that the only list stored in memory was the original one. Each combination only appeared in memory when it was needed to calculate the sum, and immediately disappeared after that. That's why it's (relatively) fast!
-## Takeaway
+# Takeaway
Of course this script isn't by any means optimal! Essentially it's a brute force, we are just checking all the possible combinations. But we are doing it in a **clean and efficient way** (credit to generators).
When you are solving real-life problems, you are not in algorithms class and you don't have to write a hardcore algo, you just have to correctly utilize amazing toolkit that this language has. I've spend no more than 5 minutes writing this and I already have the answer to my problem - that's the beauty of Python :python:!