PLATFORM
  • Tails

    Create websites with TailwindCSS

  • Wave

    Start building the next great SAAS

  • Pines

    Alpine & Tailwind UI Library

  • Auth

    Plug'n Play Authentication for Laravel

  • Designer comingsoon

    Create website designs with AI

  • DevBlog comingsoon

    Blog platform for developers

  • Static

    Build a simple static website

  • SaaS Adventure

    21-day program to build a SAAS

Richa Kiran

@algonoob

2335 Points 19 Followers

45 Posts

0 Answers

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

Typedef in C

In C, we have an option to set any other name for a specific data type. For doing that we use a keyword called "typedef". In this article, I'll be explaining how typedef works and how you ca...

Structures in C

While coding in C, you will come across many data types like - char, int, float, double, void, and so on... These data types are called **basic data types**. There's another group of data ty...

Lists in Python

List is a data structure used in Python. It is similar to the concept of arrays but unlike arrays they're more flexible about the type of data that is being stored in them. It is very easy t...

Heap Data Structure using Arrays

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

Max Heap

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

Min Heap Algorithm

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

Complete Binary Trees

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

Heap Data Structure

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

The relation between Data Structures and Algorithms

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

QuickSort Alogrithm

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

Why do we need Data Structures?

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

Divide and Conquer

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

Insertion Sort

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

Selection Sort

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

Sorting Algorithms

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

Linear Search VS Binary Search

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

Asymptotic Notations

Previously, we briefly discussed about time complexity of algorithms. You can check it out [here](https://devdojo.com/algonoob/time-complexity-of-algorithms) if you haven't yet. In this po...

Time Complexity of Algorithms

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

Binary Search

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

Search Algorithms

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

Applications of Binary Trees

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

K'th maximum element in a Binary Search Tree

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

K'th smallest element in a Binary Search Tree

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](https://algonoob.devdojo.com)....

Methods of deletion in a Binary Search Tree

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