top of page


Data Structures: the Heap
Heaps are the hidden heroes of computer science. They power priority queues, task schedulers, and algorithms like Dijkstra, offering O(log n) efficiency for insertions and deletions. Forget constantly sorting arrays—one simple property keeps the maximum or minimum always on top. With a few basic operations, heaps turn messy problems into elegant, high-performance solutions.
Alessandro Salvato
3 setTempo di lettura: 7 min


D² Trading — Trade Like an Engineer
D² Trading (Data-Driven Trading) is about turning markets into systems, not bets. Here algorithms replace instinct with models, backtests, and automation. Trading becomes an engineering problem: disciplined, measurable, and repeatable.
Alessandro Salvato
1 setTempo di lettura: 1 min


^Algo.*$ — Algorithms with a Regex Twist
^Algo.*$ is the space where algorithms step out of textbooks and into real life. From sorting and graphs to optimization and hidden patterns in search engines, games, and markets, this is a lab for logic in action. Expect stories, code, hacks, and the messy beauty of problem-solving. If it starts with “Algo,” it belongs here.
Alessandro Salvato
1 setTempo di lettura: 1 min
bottom of page