enigmavssut / cp-handbook

CP-Handbook

About

---

This Repository will Serve as a Hand-Book for Competitive-Coding in and beyond Engima. It houses the Description, Implementation, and Analysis of mostly used Data-Structures and Algorithms in any of your favorite language. Hope this Repository serves it's purpose well.

Kindly Follow the Contributing Guide.

Happy Learning :)

Topics

---

1. Data Structures

   1. Arrays
   2. Linked Lists
   3. Stacks
   4. Queues
   5. Binary Tree
   6. Binary Search Tree
   7. Heaps
   8. Hash-Tables
   9. Graphs
   10. Strings
   11. Matrix
   12. Advanced Data Structures

2. Algorithms

   1. Searching
   2. Sorting
   3. Graph Algorithms
   4. Pattern Searching
   5. Algorithms on Geometry
   6. Algorithms on Number Theory
   7. Randomized Algorithms
   8. Greedy Algorithms
   9. Dynamic Programming
   10. Divide n Conquer
   11. Back tracking
   12. Branch n Bound

Contribution Guide

---

1. Fork this Repository and make a Pull Request.
2. Every Data Structure and Algorithm can be implemented in any language of your choice. Just make sure you follow the rest of the contributing rules
3. Data Structures are to be put into different folders. Each folder can have only one Implementation of the said Data-Structure in each language.
4. Every Paradigm of Algorithms can have many algorithms belonging to them. Make sure you make a folder for each of these algorithms inside the correct paradigm. Each Algorithm may have several sub-folders according to the language of implementation of the Algorithm. Each of these Language Sub-Folders may have different implementation of the same algorithm.
5. Each commit must properly be named and the PR must not have merge conflicts.
6. Include proper documentation for the data structures and Algorithms you are implementing. So that it'll be easier for others to understand your approach and implementation.