Linear Search and Binary Search are two popular searching algorithms. In this article, we'll be comparing the two algorithms in order to find out which algorithm is better based on their applications. An Overview Everyday we come across various situa...

Previously, we briefly discussed about time complexity of algorithms. You can check it out here if you haven't yet. In this post we'll learn about the concept of time complexity in a more detailed way. A mathematical way of representing the time comp...

The time complexity of an algorithm is the time taken by an algorithm to run. The significance Sometimes, when we try to solve a problem, we might think of more than one way to solve it. Now some of these approaches might take less time to come to th...

Binary Searching algorithm is used to search for an element in a sorted array. It involves dividing an array into halves until the element is finally found. I've already given a brief introduction of this algorithm in one of my previous posts. You ca...

In this article I'm gonna be talking about the mechanism of Linear Search Algorithm and how you can implement it in C. I've already given you a brief introduction of this algorithm in my previous article. You can check it out here. So, summing it all...

Searching algorithms are designed to locate the position of an element (if present) in a data structure. To search for an element in a linear data structure like an array, we can use many different types of searching algorithms. Here we're gonna tal...

So far we've discussed about how we can perform certain operations on a Binary Search Tree. It is no fun to learn about new stuff when you don't know where exactly you can use it. So, In this article I'm gonna be talking about the applications of Bin...

In this article I'm gonna talk about how we can find the k'th maximum element in a given Binary Search Tree. Previously we talked about the methods of finding the k'th minimum element in a BST. If you haven't read that yet, please check it out here b...

So far we've discussed about insertion, deletion and searching operations in a Binary Search Tree. If you haven't read them yet, you can check them out here. In this post I'm gonna talk about how you can find the K'th - Minimum element in a Binary Se...

In this post I'm gonna be talking about deletion of a node in Binary Search Tree. There can be three scenarios for deletion of a node in a Binary Search Tree. Let's first discuss the three scenarios. The three situations of deletion 1. Node to be de...