diff --git a/src/algorithms/backtracking/intro.md b/src/algorithms/backtracking/intro.md new file mode 100644 index 0000000..1ff9243 --- /dev/null +++ b/src/algorithms/backtracking/intro.md @@ -0,0 +1,5 @@ +### Backtracking Algorithms + +1- [N-Queens Problem](./n-queens.md) +2- [Sudoku Solver](./sudoku-solver.md) +3- [Maze Solving](./maze.md) \ No newline at end of file diff --git a/src/algorithms/cryptographic/intro.md b/src/algorithms/cryptographic/intro.md new file mode 100644 index 0000000..0f65510 --- /dev/null +++ b/src/algorithms/cryptographic/intro.md @@ -0,0 +1,6 @@ +### Cryptographic Algorithms + +1- [RSA (Asymmetric Encryption)](./rsa.md) +2- [AES (Symmetric Encryption)](./aes.md) +3- [SHA-256 (Hashing)](./sha-256.md) +4- [Diffie-Hellman (Key Exchange)](./diffie-hellman.md) \ No newline at end of file diff --git a/src/algorithms/divide-conquer/intro.md b/src/algorithms/divide-conquer/intro.md new file mode 100644 index 0000000..4ae392d --- /dev/null +++ b/src/algorithms/divide-conquer/intro.md @@ -0,0 +1,5 @@ +### Divide and Conquer Algorithms + +1- [Merge Sort](./merge-sort.md) +2- [QuickSort](./quick-sort.md) +3- [Binary Search](./binary-search.md) \ No newline at end of file diff --git a/src/algorithms/dynamic-programming/intro.md b/src/algorithms/dynamic-programming/intro.md new file mode 100644 index 0000000..f1ae760 --- /dev/null +++ b/src/algorithms/dynamic-programming/intro.md @@ -0,0 +1,6 @@ +### Dynamic Programming Algorithms + +1- [Knapsack Problem](./kanpsack-problem.md) +2- [Longest Common Subsequence](./longest-common-subsequence.md) +3- [Matrix Chain Multiplication](./matrix-chain-multiplication.md) +4- [Fibonacci Sequence](./fibonacci.md) \ No newline at end of file diff --git a/src/algorithms/graph/intro.md b/src/algorithms/graph/intro.md new file mode 100644 index 0000000..a76ce52 --- /dev/null +++ b/src/algorithms/graph/intro.md @@ -0,0 +1,7 @@ +### Graph Algorithms + +1- [Dijkstra’s Algorithm (Shortest Path)](./shortest-path.md) +2- [Kruskal’s Algorithm (Minimum Spanning Tree)](./minimum-spanning-tree.md) +3- [Prim’s Algorithm (Minimum Spanning Tree)](./minimum-spanning-tree.md) +4- [A* Algorithm (Pathfinding)](./pathfinding.md) +5- [Floyd-Warshall Algorithm (All-Pairs Shortest Path)](./all-pairs-shortest-path.md) diff --git a/src/algorithms/greedy/into.md b/src/algorithms/greedy/into.md new file mode 100644 index 0000000..c7a03db --- /dev/null +++ b/src/algorithms/greedy/into.md @@ -0,0 +1,5 @@ +### Greedy Algorithms + +1- [Huffman Coding](./huffman-coding.md) +2- [Dijkstra’s Algorithm](./dijkstras.md) +3- [Activity Selection Problem](./activity-selection.md) \ No newline at end of file diff --git a/src/algorithms/intro.md b/src/algorithms/intro.md index d9e02b2..28219f1 100644 --- a/src/algorithms/intro.md +++ b/src/algorithms/intro.md @@ -1,73 +1,15 @@ -# Sorting Algorithms -**Purpose:** Arrange data in a specific order (ascending, descending, etc.). +Work in progress... -**Examples:** -- Bubble Sort -- QuickSort -- Merge Sort -- Heap Sort -- Counting Sort - -# Searching Algorithms -**Purpose:** Locate specific data in a dataset. - -**Examples:** -- Linear Search -- Binary Search -- Depth-First Search (DFS) -- Breadth-First Search (BFS) - -# Graph Algorithms -**Purpose:** Solve problems involving graphs (nodes and edges). - -**Examples:** -- Dijkstra’s Algorithm (Shortest Path) -- Kruskal’s Algorithm (Minimum Spanning Tree) -- Prim’s Algorithm (Minimum Spanning Tree) -- A* Algorithm (Pathfinding) -- Floyd-Warshall Algorithm (All-Pairs Shortest Path) - -# Dynamic Programming Algorithms -**Purpose:** Solve complex problems by breaking them down into overlapping subproblems. - -**Examples:** -- Knapsack Problem -- Longest Common Subsequence -- Matrix Chain Multiplication -- Fibonacci Sequence - -# Divide and Conquer Algorithms -**Purpose:** Divide a problem into smaller subproblems, solve them independently, and combine results. +1- [Sorting Algorithms](./sorting/intro.md): Arrange data in a specific order (ascending, descending, etc.). +2- [Searching Algorithms](./searching/intro.md): Locate specific data in a dataset. +3- [Graph Algorithms](./graph/intro.md): Solve problems involving graphs (nodes and edges). +4- [Dynamic Programming Algorithms](./dynamic-programming/intro.md): Solve complex problems by breaking them down into overlapping subproblems. +5- [Divide and Conquer Algorithms](./divide-conquer/intro.md): Divide a problem into smaller subproblems, solve them independently, and combine results. +6- [Greedy Algorithms](./greedy/intro.md): Make the locally optimal choice at each step. +7- [Backtracking Algorithms](./backtracking/intro.md): Solve constraint satisfaction problems by exploring possibilities recursively. +8- [Cryptographic Algorithms](./cryptographic) Secure data and communications. -**Examples:** -- Merge Sort -- QuickSort -- Binary Search - -# Greedy Algorithms -**Purpose:** Make the locally optimal choice at each step. - -**Examples:** -- Huffman Coding -- Dijkstra’s Algorithm -- Activity Selection Problem - -# Backtracking Algorithms -**Purpose:** Solve constraint satisfaction problems by exploring possibilities recursively. - -**Examples:** -- N-Queens Problem -- Sudoku Solver -- Maze Solving - -# Cryptographic Algorithms -**Purpose:** Secure data and communications. - -**Examples:** -- RSA (Asymmetric Encryption) -- AES (Symmetric Encryption) -- SHA-256 (Hashing) -- Diffie-Hellman (Key Exchange) + \ No newline at end of file diff --git a/src/algorithms/searching/intro.md b/src/algorithms/searching/intro.md new file mode 100644 index 0000000..73b68d3 --- /dev/null +++ b/src/algorithms/searching/intro.md @@ -0,0 +1,6 @@ +### Searching Algorithms + +1- [Linear Search](./linear.md) +2- [Binary Search](./binary.md) +3- [Depth-First Search (DFS)](./depth-first.md) +4- [Breadth-First Search (BFS)](./breadth-first.md) \ No newline at end of file diff --git a/src/algorithms/sorting/intro.md b/src/algorithms/sorting/intro.md new file mode 100644 index 0000000..30e6e7b --- /dev/null +++ b/src/algorithms/sorting/intro.md @@ -0,0 +1,9 @@ +### Sorting Algorithms + +1- [Bubble Sort](./buble.md) +2- [QuickSort](./quick.md) +3- [Merge Sort](./merge.md) +4- [Heap Sort](./heap.md) +5- [Counting Sort](./counting.md) + +