Why do you bind?

Have you ever run into a problem where you have added an event listener using bind, but the event handler continues to execute even though you have removed the listener? If yes, read on. A few months ago, when I was working on one of the React components, I added an event listener to the

Read More


Asymptotic Notations – II

In this post, we will see the remaining two asymptotic notations. The algorithm we were discussing was the linear search. We had calculated the estimated time complexity as 2n + 3. To read the previous post, click here. Big-Omega – The Lower Bound function f (n) belongs to big-omega of g (n) if there exist

Read More


Asymptotic Notations – I

In this post, I will discuss the time functions in asymptotic notations. You probably have heard about asymptotic notations. They are the Big-Oh, Big-Omega, and Theta functions. I had read in details about them when I was in doing my B. Tech [I couldn’t recollect which semester, and that is a pity]. It is going

Read More


Why do Exponential Functions Hurt?

Before we move further, let us recap the types of time complexity functions we have encountered till now. We will also see that algorithms with exponential functions are evil. Here is the list of functions we have seen till now. The sequence of these functions is the same as written above. That is, a quadratic

Read More


Basics of Logarithms

Before we move to the time complexity of the next algorithm, I’ve decided to give it a break and write a short post about logarithms, they are crucial. I’ll be honest, and I’ll confess that I always had a hard time understanding the concept of logarithms. While working with time complexities of the algorithms, we

Read More