Subscribe to my newsletter and never miss my upcoming articles

Priority Queues with Binary Heaps

Jan 7, 20218 min read

I’m starting a data structure series where I introduce you to popular data structures and their implementations. I'll start with Priority Queues with Binary Heaps. One of my favorite data structure is binary heaps. In this article I'll show you what ...

Introducing an efficient Big O analyzer

Dec 29, 20209 min read

Introducing an efficient Big O analyzer, a premium state-of-the-art AKDSFramework feature to analyze Big O for any function without any human intervention. As you already know calculating big O is a big part of what we do to approximate the running t...

Speed up your python code by caching

Dec 26, 20206 min read

Let's say you have a function that is a super-slow function. Not sure how you can find which is a super slow function? Measure it with this. Now there is now way you can optimize the function, what you can do instead is that you can store results fro...

How to benchmark your python program?

Nov 21, 20204 min read

Let's say you have a really slow program and you want to benchmark where your program is taking most of the time to run. If you can find that you can just optimize that part of the program to run faster. There is couple of way of doing this going thr...

What is logarithms in time complexity means?

Nov 14, 20205 min read

If we talk about some sorting algorithms we'll see their running time is in the order of \(O(n log(n))\) time. In this article we'll talk why logarithm time is useful and how it's working? Let's imagine the following task for i in range(10): prin...

4 Line python-based URL shortener

Nov 2, 20201 min read

Let's build an URL shortener with just 4 lines of code. I'll keep it as simple as possible. Inspiration I was building a discord BOT that has the feature of sending top news article in a given hour, but the URLs were too long so it was looking bad in...