SAITC's Data Structures & Algorithms

By Monterrey Institute of Technology CS Students - for education.

Data Structures

Table of Contents

1. Linked List
   Details

   1. Singly Linked List
   2. Doubly Linked List
2. Stack
3. Queue
   Details

   1. Standard Queue
   2. Priority Queue
4. Hash Table
5. Heap
   Details

   1. Standard Heap
   2. Fibonacci Heap
6. Trie
   Details

   1. Standard Trie
7. Tree
8. Graph
   Details

   1. Directed Graph
      1. Adjacency List
      2. Adjacency Matrix
   2. Undirected Graph
      1. Adjacency List
      2. Adjacency Matrix

Algorithms

Table of Contents

1. Mathematical
2. Sorting
3. Searching
   Searching Graph Algorithm's

   1. Depth First Search
   2. Breadth First Search
   3. Greedy Best First Search
   4. A* Search
4. String Processing
   Searching Substrings & Palindromes

   1. Boyer-Moore Algorithm
   2. Knuth-Morris-Pratt Algorithm
   3. Longest Common Substring (DP)
   4. Manacher's Algorithm
   5. Z-Function Algorithm
5. Geometric
6. Graph
7. Compression
8. Encryption

Contributing

Read through our Contribution Guidelines before you contribute.

Made with contrib.rocks.

Languages