As the name implies, a linked list is a list of items (referred to as nodes). Unlike an array, the memory allocation for the nodes of a linked list is not contiguous. In simple linked list (i.e. uni-direction), a node has two attributes. Its value. A reference to the next node in the list. For
Implementation of stacks and queues in JavaScript is straightforward. We can use the existing Array object and its method to simulate stacks and queue behaviour. Stacks and queues get the contiguous memory allocation. Elements of stack and queue get the memory (allocation) next to each other. Unlike low-level language C, we do not explicitly create
At first, it would seem that the singleton pattern is similar to the module/revealing module pattern where we create only one instance of the object. However, the difference here is we can delay the instantiation of the object, i.e. based on the requirement. The singleton pattern restricts the instance of an object (class) to one.
In the constructor pattern, we create an object using constructor functions, but in the module pattern, we use the object literals. We already know the ways to create an object, if you’d like to read about it, click here. Creating an object using object literals is a simple task. We need to provide the key-value
The constructor pattern in JavaScript is the simplest one perhaps. All we need to do is to create a constructor function, add properties and methods to it. It’s ready to use. There are lots of blogs on the internet about what are design patterns, why should we use them, how they make developers lives simple,
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
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
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
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
In this post, I am going to talk about the time complexity of one more type of algorithms. Once again, we do not need to discuss the space complexity as it is going to be the same as all the other for loops. In the previous post, I had given a small introduction of logarithmic
