A Dev's Notebook

Notes on breaking and improving things.

Featured

• Why Is The Time Complexity of Heapification O(n)?

  Posted on:March 25, 2025 |  at 01:36 PM

  You may think it is O(n log n), but it's actually O(n). Let's find out the reasoning

Recent Posts

• Fibonacci Q-Matrix for Dummies

  Posted on:July 5, 2024 |  at 09:17 AM

  Once you understand this concept, proving the Fibonacci formula will be elementary

• How to implement multiset from scratch in Javascript, when AI couldn't (yet)

  Posted on:July 5, 2024 |  at 09:17 AM

  I've been happily using AI to convert codes written in unfamilar languages to Javascript. I finally found something AI couldn't do yet.

• Using Dynamic Programming for Solving Single Source Shortest Path

  Posted on:February 21, 2024 |  at 10:33 AM

  A probably overkill approach to find the single-source shortest path using dynamic programming

• Space Complexity of Adjacency Matrix and Adjacency List

  Posted on:February 21, 2024 |  at 10:33 AM

  Space complexity of adjacency matrix is `O(V^2)`. So why is space complexity of adjacency list `O(V + E)`