Data Structures and Algorithms

This repository explores through the world of Data Structures and a few standard algorithms using multiple programming languages.

Index

Data Structures

1. Linked List

S.no	Name	Description
1	Linked List	The implementation of a simple linked list.
2	Circular Linked List
3	Double Linked List

2. Stack

S.no	Name	Description
1	Stack	implementation of stack with complete code
2	Stack with cells as Nodes in C++	Stack implementation with cells of any type, implemented using templates in C++

3. Queue

S.no	Name	Description
1	Queue	implementation of queue with complete code
2	Queue with cells as Nodes in C++	Queue implementation with cells of any type, implemented using templates in C++

4. Tree

S.no	Name	Description
1	Binary Tree
2	Binary Search Tree
3	AVL Tree

5. Heap

S.no	Name	Description
1	Min heap
2	Max-Heap

6. Hash Table

7. Graph

S.no	Name	Description
1	Building Graphs	Codes for building various categories of graphs
2	Depth First Traversal
3	Breadth First Traversal
4	Cycle Detection
5	Union Find
6	Dijkstra
7	Bellaman Ford
8	Longest and Shortest Paths
9	Minimum Spanning Tree
10	Topological Sort

8. Trie

Algorithms

1. Searching Algorithms

S.no	Algorithm Name
1	Linear Search
2	Binary Search

2. Sorting Algorithms

S.no	Algorithm Name
1	Selection Sort
2	Bubble Sort
3	Counting Sort
4	Insertion Sort
5	Merge Sort
6	Quick Sort
7	Heap Sort
8	Radix Sort

3. Catalan Numbers

4. Document Distance

5. Karatsuba Multiplication

6. Peak Finder

7. Rabin Karp

Language Based Libraries

In this section, we deal with the library functions which can be used to simplify the implementations of the data structures used above, so as to reduce the programming time, and improve efficiency.

We will also deal with a few library classes and function which simplifies the smaller tasks, which are standard in nature, and need not be implemented from scratch everytime they are needed.

1. Python