What is an Algorithm?

Space and Time Complexity of an Algorithm

Time Complexity Big-Oh Notation

Time Complexity Big-Omega Notation

Time Complexity Big-Theta Notation

Asymptotic Notations GATE Problem 1

Asymptotic Notations GATE Problem 2

Time Complexity GATE Problem

Algorithm Classification Simple Recursive Algorithm

Algorithm Classification Back Tracking Algorithm

Algorithm Classification Divide and Conquer

Algorithm Classification Dynamic Programming

Algorithm Classification Greedy Algorithm

Algorithm Classification Branch and Bound

Algorithm Classification Brute Force

Algorithm Classification Randomized Algorithm

String Introduction

String Operations

String Processing Insert

String Processing Delete

String Processing Replace

Pattern Matching Algorithm - Brute Force

Knuth Morris Patterson (KMP) Pattern Matching Algorithm

KMP Pattern Matching Algorithm Example

Definition of Linear Array

Insert Operation on an Array

Delete Operation on an Array

Memory Representation of One Dimensional Array

Memory Representation of Two Dimensional Array in Row Major

Memory Representation of Two Dimensional Array in Column Major

Saddle Point of a Matrix

Saddle Point Implementation Algorithm

Lower Triangular Sparse Matrix

Tridiagonal Sparse Matrix

Another Sparse Matrix Example

Array GATE Problem

Definition of Recursion

Recursion Variations Direct

Recursion Variations Indirect

Recursion Variations Nested

Recursion Variations Excessive

Recursion Variations Tail

Recursion Overheads

Towers of Hanoi as an Example of Recursion

Recursion GATE Problem 1

Recursion GATE Problem 2

Linked List Introduction

Linked List Traversing and Processing

Linked List Finding Maximum and Minimum Node Info

Linked List Searching on Unsorted Linked List

Linked List Searching on Sorted Linked List

Linked List Insert a New Node as The First Node

Linked List Insert a New Node After Search Node

Linked List Deletion of a Node With Given Info

Header Linked List Introduction

Header Linked List Insertion as The First Node

Circular Header Linked List Introduction

Two Way Linked List Introduction

Two Way Linked List Insertion

Two Way Linked List Deletion

Reverse of a Linked List

Polynomial Representation Using a Linked List

Polynomial Addition Using Linked List Example

Polynomial Addition Using Linked List Algorithm

Stack - Introduction

Stack Operations Introduction

Stack Operations - PUSH & POP

Implementing Two Stacks in One Array

Implementing Four Stacks in One Array

Stack Application Evaluation of Post Fix Expression

Stack Application Evaluation of Post Fix Expression Example

Stack Application Infix to Postfix Conversion

Stack Application Infix to Postfix Conversion Example

Exercise on Stack

Queue Operations Introduction

Queue Operations Insert

Queue Operations Delete

Priority Queue

Binary Tree and Terminologies

Binary Tree Representation in Memory

Binary Tree Traversals

Binary Tree Traversals Exercise 1

Binary Tree Traversals Exercise 2

Algorithm of In-Order Traversal

Algorithm of Pre-Order Traversal

Algorithm of Post-Order Traversal

Binary Search Tree Introduction

Searching an Item in BST

Deletion of a Node From BST With One Or Zero Child Node

Deletion of a Node From BST With Two Children

Deleting a Node From BST

Ranked Binary Search Tree

Extended Binary Tree Or 2-Tree

Huffman’s Algorithm With Example

Huffman’s Coding

Huffman Code Example

Binary Tree Example

Binary Search Tree Example 1

Binary Search Tree Example 2

AVL Tree - A Height Balanced Tree

AVL Search Tree LL and RR Rotation

AVL Search Tree RL and LR Rotation

AVL Search Tree Example

B-Tree Definition and Properties

B-Tree an Example

Heap Tree

Heap Tree Insertion Operation

Heap Tree Insertion Operation Example

Heap Tree Deletion Operation

Heap Tree - Deletion Operation Example

Heap Sort

Heap Sort GATE Problem

Bubble Sort

Modified Bubble Sort

Insertion Sort

Selection Sort

Quick Sort

Merge Sort

Execution Tracing of Merge Sort

Radix Sort Example

Radix Sort Algorithm

Exercise 1 On Sorting

Exercise 2 on Sorting

External Sorting - Introduction

External Sorting Sample Implementation

Linear Search

Linear Search on Sorted Array

Binary Search

Trie Structure Algorithm

Trie Structure Example

Hashing Introduction

Hashing Collision and Collision Resolution

Hashing Chaining

Hashing Chaining Example

Hashing With Example

Exercise on Hashing