dsalglib : Data Structures and Algorithms Template Library all from scratch.

No standard library functions and dependencies.

This is improved and stable version of dsalib ready to use C++ data structures and algorithms template library. Multiple Data Structures and Algorithms are implemented in template format.

Following Data Structures and Algorithms are being implemented here. Please go through the existing implementations and start implementing Data Structure or Algorithm or your choice.

Contribute to DSALGLIB

• This Library does not use any inbuilt functions and libraries.
• Please go through the implementations and understand the philosophy of library.
• Every container must be a class and it must not use any inbuilt library and functions of C++.
• Try to write comments in code. Implement or Enhance any Data Structure or Algorithm.

Thanks for taking time :)

Essential Functions:

• swapit
• maxof and minof

Data Structures:

• Array
• Linked List ( Doubly Circular for generic purposes)
• Queue
• Stack
• Matrix
• Binary Search Tree
• AVL Tree
• Splay Tree
• Binary Indexed Tree
• Red Black Tree
• Segment Tree
• Hash Table
• Suffix Tree
• Suffix Array
• Min Heap
• Max Heap
• Graph

Algorithms :

• Binary Search
• KMP Search
• Selection Sort
• Bubble Sort
• Insertion Sort
• Shell Sort
• Quick Sort
• Heap Sort
• Merge Sort
• Number Theory Algorithms