Hello, my name is Richa. Welcome to my Dev Blog

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

Blog Post illustration

Min Heap Algorithm

Published

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, we're gonna see how you can call "Heapify" on a c...

algonoob avatar
Richa Kiran
Blog Post illustration

Complete Binary Trees

Published

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. So if you don't know what binary trees are you can check out...

algonoob avatar
Richa Kiran
Blog Post illustration

Heap Data Structure

Published

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 kinds of heaps and their applications. What is Heap Data Str...

algonoob avatar
Richa Kiran
Blog Post illustration

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 simply defined as the way of storing data in an organized wa...

algonoob avatar
Richa Kiran
Blog Post illustration

QuickSort Alogrithm

Published

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 on Divide and Conquer Strategy. Through this algorithm, we ...

algonoob avatar
Richa Kiran
Blog Post illustration

Why do we need Data Structures?

Published

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 without a search option! Exhausted just by the thought of it, you ...

algonoob avatar
Richa Kiran
Blog Post illustration

Merge Sort

Published

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 Merge Sort? It is a sorting algorithm that makes use of Divide...

algonoob avatar
Richa Kiran
Blog Post illustration

Divide and Conquer

Published

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-problem one by one until all the sub-problems are solved. This...

algonoob avatar
Richa Kiran
Blog Post illustration

Insertion Sort

Published

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 correct position in the sorted part. What is insertion sort?...

algonoob avatar
Richa Kiran
Blog Post illustration

Selection Sort

Published

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 unsorted part of the array repeatedly to find the smallest element...

algonoob avatar
Richa Kiran
« 1 2 3 4