Big O Notation

Asymptotic Analysis

Measuring Running time of Algorithms

Data Structures and Algorithms

Finding Big O

Tight and Loose Upper Bounds

Big O analysis of Algorithms

Finding Time complexity

Worst case, Best case and Average Case Analysis

Big O analysis of Algorithms Examples

Common Complexities

Abstract Data Types

Introduction to Data Structures and Algorithms Through C# In Depth

Introduction to Linked List in C#

Traversing and Searching a Single Linked List

Insertion in a Single Linked List ..contd

Finding references in a single linked list

Insertion in a Single Linked List

Deletion in a Single Linked List

Reversing a Single Linked List

Sorting a Linked list using Bubble Sort

Sorting a Linked list using Merge Sort

Merging of sorted Linked lists

Finding and Removing a cycle in a Linked list

Insertion in a doubly linked List

Reversing a doubly linked list

Deletion from doubly linked list

Circular linked list

Doubly linked list

Insertion in a circular Linked List

Concatenation

Deletion in a circular linked list

Sorted linked list

Introduction

Stack

Array Implementation of Stack

Queue

Linked List Implementation of Stack

Linked List implementation of Queue

Array Implementation of Queue

Queue through Circular Linked List

Circular Queue

Deque

Checking validity of an expression containing nested parentheses

Evaluating Arithmetic Expressions

Polish Notations

Priority Queue

Evaluation of postfix expression

Converting infix expression to postfix expression

Winding and unwinding phase

Flow of control in Recursive functions

Factorial

Sum of digits of an integer

Printing numbers from 1 to n

Finding nth power of a number

Euclids Algorithm

Fibonacci Series

Base conversion

Tail recursion

Recursion vs. Iteration

Tower of Hanoi

Introduction to trees

Binary Tree

Strictly Binary Tree and Extended Binary Tree

Full binary tree and Complete Binary Tree

Linked Representation of Binary Trees

Binary Tree in C#

Array Representation of Binary trees

Traversal in Binary Tree

Preorder Traversal

Inorder Traversal

Finding height of a Binary tree

Postorder Traversal

Level order traversal

Constructing Binary tree from Traversals

Constructing binary tree from inorder and preorder traversals

Constructing binary tree from inorder and postorder traversals

Traversal in Binary Search Tree

Searching in a Binary Search Tree

Nodes with Minimum and Maximum key

Insertion in a Binary Search Tree

Deletion in a Binary Search Tree

Heap Representation

Deletion

Heap Applications

Building a heap

Insertion in Heap

Introduction to Sorting Algorithms

Selection Sort

Selection Sort in C#

Bubble Sort

Analysis of Selection Sort

Selection Sort Example

Sort Stability

Bubble Sort Example

Analysis of Bubble Sort

Improvement in Bubble Sort

Insertion Sort

Insertion Sort Example

Bubble Sort in C#

Insertion Sort in C#

Analysis of Shell Sort

Shell Sort

Shell Sort Example

Shell Sort in C#

Analysis of Insertion sort

Recursive Merge Sort

Merging two Sorted Arrays

Analysis of Merge Sort

Recursive Merge Sort in C#

Iterative Merge Sort

Iterative Merge Sort in C#

Quick Sort

Binary Tree Sort in C#

Binary tree sort

Analysis of Quick Sort

Analysis of Binary Tree Sort

Quick Sort in C#

Heap Sort

Heap Sort C# implementation and Analysis

Address Calculation Sort

Radix Sort

Address Calculation Sort in C#

Radix Sort C# implementation and Analysis

Analysis of Address Calculation Sort

Linear Search

Binary Search

Variations of Linear Search

Implementation of Binary Search

Analysis of Binary Search

Direct Addressing

Collisions

Hashing

Open Addressing Linear Probing

Hash Functions

Open Addressing Double Hashing

Deletion in Open Addressed Tables

Implementation of Open Addressing

Open Addressing Quadratic Probing

Implementation of Separate Chaining

Separate Chaining