Data Structure and Algorithms

Data Structure and Algorithms are the building blocks of computer programming. A well-defined data structure helps us in keeping our data organized. Some of the commonly used data structures are List, Queue, Stack, Tree etc.

The algorithms provide different ways to achieve a task on these data structures. Some of the common algorithms are in the area of sorting and searching elements in the data structure.

Quicksort Algorithm

The QuickSort Algorithm – Implementation in C, Java, Python

Introduction Quicksort algorithm is one of the fastest internal sorting algorithms and today we are going to discuss this topic. It is mainly based on the following three main strategies: Split or Partition: Select a….

Binary Search Tree

Binary Search Tree in C/C++

In this article, we’ll take a look at implementing a Binary Search Tree in C/C++. A Binary Search Tree(BST) is a Binary Tree in which every element of a left sub-tree is less than the….

Stacks

Understanding the Stack Data Structure

In this article, we’ll be understanding the working and the need for the Stack Data Structure. When programming, we often deal with a huge amount of uneven and raw data. This calls for the need….

Min Heap Binary Tree

Min Heap Binary Tree

A Min Heap Binary Tree is a Binary Tree where the root node has the minimum key in the tree. The above definition holds true for all sub-trees in the tree. This is called the….

Trie Data Structure

Trie Data Structure in C/C++

A Trie data structure acts as a container for a dynamic array. In this article, we shall look at how we can implement a Trie in C/C++. This is based on the tree data structure….

Select Sort Featured Image

Selection Sort Algorithm Implemented in Python, Java, and C/C++

The Selection Sort Algorithm sorts the elements of an array. In this article, we shall look at the core algorithm and how we can implement it in Python, Java, C++, and C. The Core Algorithm….

Queue In C

Creating a Queue in C

A queue in C is basically a linear data structure to store and manipulate the data elements. It follows the order of First In First Out (FIFO). In queues, the first element entered into the….

DFS

Depth First Search (DFS) for a Graph

Depth First Search (DFS) is an algorithm that searches a graph/tree, in a depth-wise manner. There are many ways through which we can traverse through a graph. The two most common methods that we can….

Graph Theory Basics

Basics of Graph Theory

In this article, we’ll touch upon the graph theory basics. Graph Theory is a branch of mathematics that aims at studying problems related to a structure called a Graph. In this article, we will try….

Queue In C++

Queue in C++

Introduction We worked on the working as well as the implementation of a Stack in C++ in our previous tutorial. Today in this tutorial, we are going to discuss another data structure, Queue in C++…..

close
Generic selectors
Exact matches only
Search in title
Search in content
Search in posts
Search in pages