algorithms-datastructures


Basics of Big O notation.

When I was a college student I didn't know that every computer science problem has multiple ways to solve it(I ...
Read More

Time complexity for conditional and looping statements.

In my previous article about the time complexity and big o notation, I have given an overview of the procedure, ...
Read More

Bubble sorting algorithm

Introduction to bubble sort:- Bubble sorting algorithm is the first and easiest algorithm we think of generally when it comes ...
Read More

selection sorting algorithm

In my previous article about bubble sort, I have discussed thoroughly bubble sort. if you haven't checked it yet give ...
Read More

Insertion sorting algorithm

Firstly, before diving into the insertion sort, If you are new to sorting algorithms, it will be easy to understand ...
Read More

Merge sort algorithm

Why not traditional sorting algorithms? Firstly, Before getting into the merge sort explanation, Let's see why traditional sorting algorithms(Bubble, Selection, ...
Read More

Quick sorting algorithm

 Introduction to Quick sort:-Quick sort is one of the intermediate sorting algorithms which works similar to merge sort. It also ...
Read More

radix sorting algorithm.

Introduction to Radix sort:-If you had observed in previous sorting algorithms (Bubble, Selection, insertion, quick and merge sorting) we have seen how can we sort ...
Read More

Linear/Sequential Searching algorithm

Introduction to linear searching:-Linear searching is the default of way of searching an element or an object when we think ...
Read More

Binary searching algorithm

As I say in every article, It's always better to know why we are going for the alternative process. Because ...
Read More

Naive string search algorithm

So far, In my previous posts about searching, I have discussed various types of searching. If you observe them carefully ...
Read More

Singly linked List.

Introduction to Singly linked list(SLL):-Firstly, Singly liked list is a data structure(or any data structure for the matter) that stores ...
Read More

Doubly Linked Lists.

Introduction to Doubly linked list(DLL):-In my previous article about singly linked list i have explained about it thoroughly. Doubly linked list ...
Read More

Stacks.

Introduction to stacks:- The stack is a linear data structure in which order of the operations is important.That is to ...
Read More

Queues.

Introduction to queues:- A queue is also a linear data structure in which data is inserted from one end and ...
Read More
trees representation.

Trees, Binary trees and Binary search trees.

Introduction to Trees:- A tree is a non-linear data structure unlike a singly linked list, doubly linked list, stacks or ...
Read More

Traversing binary trees.

Traversing a linear data structure is very simple as there are no child nodes for each node. But in the ...
Read More

Heaps and binary heaps.

Introduction to heaps:- Heaps are the tree based data structures exactly like binary trees. Every heap is a binary tree ...
Read More

Priority queues.

What is a priority queue? A priority queue is a data structure where each node has a priority. The priority ...
Read More

Hash tables.

Introduction to hash tables:- Hash tables store the data in the key-value pair format. Above all, every programming language has ...
Read More