Home

Welcome to the Encyclopedia-of-Jai-Examples wiki!

This encyclopedia contains multiple diverse examples showing how to write Jai code in a didantic, easy to read style. This encyclopedia contains examples of sorting algorithms, leetcode questions, operator overloading, polymorphism, and so much more. Examples range from simple loops to complete implementations of research papers worth hundreds of lines of code.

This encyclopedia hopes to better explain through examples on how to write Jai code rather than providing a theoretical explaination of everything.

Table of Contents

1. LeetCode - Basics, Arrays, Strings

2. LeetCode - Dynamic Programming and Greedy

3. LeetCode - Trees, Graphs, and Linked Lists

4. Linked Lists and Binary Trees

   1. Linked List
   2. Binary Search Tree

5. Graph Algorithms

   1. Graph Utilities
   2. Prim's Algorithm
   3. Kruskal's Algorithm
   4. Dijkstra's Algorithm
   5. Bellman Ford Algorithm
   6. Graph Coloring Algorithm
   7. A* Pathfinding with Manhatten Distance
   8. Directed Acyclic Word Graph

6. Assembly Language Examples

7. Artificial Intelligence with Tic Tac Toe

   1. Minimax with Alpha Beta Pruning
   2. Monte Carlo Tree Search

8. Sorting and Searching Algorithms

9. Using Operator Overloading for Math

   1. Vector3
   2. Matrix
   3. Complex
   4. Integer 128

10. Polymorphic Algorithms

    1. Basic Polymorphism
    2. Polymorphic Sorting Algorithms
    3. Higher Order Functions

11. Polymorphic Data Structures

12. Metaprogramming

13. Common Mistakes

    1. Syntax and Declaration Errors
    2. Type System and Casting Errors
    3. Control Flow and Scoping Errors
    4. Memory and Pointer Errors
    5. Object Oriented Habits and Language Differences

14. Miscellaneous Code Examples