@algonoob

Joined June 13th, 2021

Just here to share whatever I've learned in Data Structures and Algorithms

A heap is a Complete Binary Tree in which elements are arranged in a specific order depending the type of Heap that we're trying to implement. It can be either the first element(root node) b...

3

A Max Heap is a Complete Binary Tree containing the largest value in the root node followed by smaller and smaller values in each succeeding layer. The last layer contains the smallest set o...

3

A heap is a Complete Binary Tree having its nodes or elements in an ordered way. Based on this order, we define two types of Heap data structures - Min Heaps and Max Heaps. In this tutorial,...

4

In this post, I'm gonna share some basic knowledge about a concept of data structures called "Complete Binary Trees". We're just gonna build upon the concept of Binary trees here....

3

A Heap is a specific kind of Binary Tree called Complete Binary Tree, arranged in a specific order. In this article, I'm gonna tell you what exactly we mean by a "Heap", different...

5

In this article we're gonna talk about the association between two very important components of programming, Data Structures and Algorithms.
What are Data Structures?
Data Structures can be...

4

In this article we're gonna see a basic layout of the Quicksort Algorithm and how we can implement it in C language.
What is Quicksort Algorithm?
It is a simple sorting algorithm that works...

4

Imagine that you've been eyeing a book for sometime and you wanna buy it. You try to look it up on Amazon.com but without a search option. No wonder how tedious it would be to find it withou...

4

Merge Sort is a sorting technique based on divide and conquer strategy. It is one of the efficient sorting algorithms as its worst case time complexity is of the order of nlog(n).
What is Me...

2

Divide and conquer is just a simple yet complex strategy of solving problems. It basically includes the idea of dividing a problem into sub-problems or smaller problems. We solve each sub-pr...

5

Insertion sort is a technique of sorting wherein you build a sorted array from an unsorted one by picking wrongly placed elements from the unsorted part of the array and placing them at the...

7

In this article I'm gonna talk about selection sort algorithm and how to implement it in C language.
What is Selection Sort?
The main idea behind this sorting algorithm is to scan the unsort...

9

In this article I'm gonna talk about Bubble Sort Algorithm. It is one of the simplest Sorting Algorithms there exists for sorting.
Let's get started!
What is Bubble Sort?
Bubble sort is a so...

2

Sorting means to arrange a group of things in a specific order. Algorithms that help us sort a group of items are called Sorting Algorithms.
In this article I'm gonna give a brief introducti...

6

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 app...

7

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 de...

7

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...

4

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 introd...

4

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 pre...

2

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 di...

4

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 thi...

6

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 B...

4

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 abou...

5

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 s...

5

In this post, I'm gonna be talking about how we can search for an element in a Binary Search Tree.
It is very easy to search for an element in a Binary Search Tree, easier than even in an ar...

6

In this article I'm gonna talk about the ways of traversal we can perform on Binary Trees.
A node of a binary tree primarily consists of three components -
it's own data (D)
It's left chil...

5

A Binary Search Tree is a Tree in which each node has not more than two child nodes, and each of the child nodes are inserted in the tree based on a certain rule - the left child should have...

8

Binary trees are a type of Tree data structure wherein each node has at-most 2 child nodes.
We've already discussed about Tree data structure. So, in this article we're gonna talk about the...

6

A Tree is a non linear data structure. Unlike the data structures that we've learned so far like - Linked Lists, Stacks, Queues, etc. In this type of data structure, one element can be linke...

6

Till now we've come across many different types of data structures. In this article I'm gonna be talking about a concept called Abstract Data Type.
Primitive Data Types
But before getting st...

7

Loading More Content

Type

Post

to search for a specific post

Type

User

to search for a specific user

or, type a section to quickly jump to that page

Next,