AIBauchi / AIBauchi/PyDS-A

Request: Implementation of Additional Algorithms.

未关闭
#2 21 条评论 0 个 reaction 已指派 0 人 在 GitHub 查看
collaborate good first issue hacktoberfest help wanted learn ToDo
主要语言
Python
星标
8
派生
13
PR 合并指标
30 天内没有已合并 PR

描述

## Issue Description

We're looking to enhance the functionality of PyDS-A by adding more methods to our existing algorithms. This will provide users with a more comprehensive toolkit for solving various programming challenges.

## Proposed Methods

Please keep in mind that the proper way to link an issue to this list is to comment:

### Algorithms:

**Sorting Algorithms:**

- [ ] #3
- [x] #4
- [x] #16
- [x] #12
- [x] #13
- [x] #18
- [ ] Radix Sort
- [x] #19
- [ ] #55
- [x] #25

**Searching Algorithms:**

- [ ] Linear Search
- [ ] #17
- [x] Jump Search
- [ ] Depth-First Search (DFS)
- [x] #26

**Graph Algorithms:**

- [ ] Dijkstra's Algorithm
- [ ] Bellman-Ford Algorithm
- [ ] Kruskal's Algorithm (Minimum Spanning Tree)
- [ ] Topological Sort
- [ ] Prim's Algorithm (Minimum Spanning Tree)
- [ ] Floyd-Warshall Algorithm (All-Pairs Shortest Path)
- [ ] A* Search Algorithm (Pathfinding)

**Dynamic Programming:**

- [x] Fibonacci Sequence
- [ ] Longest Common Subsequence
- [ ] Knapsack Problem
- [ ] Matrix Chain Multiplication
- [ ] Edit Distance

**Greedy Algorithms:**

- [ ] Huffman Coding
- [ ] Activity Selection
- [ ] Fractional Knapsack
- [ ] Minimum Spanning Tree (Prim's and Kruskal's algorithms)

**Divide and Conquer:**

- [ ] Closest Pair of Points
- [ ] Strassen's Matrix Multiplication
- [ ] Fast Fourier Transform (FFT)

**Backtracking Algorithms:**

- [ ] N-Queens Problem
- [ ] Sudoku Solver
- [ ] Hamiltonian Cycle
- [ ] Subset Sum

**String Algorithms:**

- [ ] String Searching (KMP, Boyer-Moore)
- [ ] Longest Common Substring
- [ ] Regular Expressions
- [ ] Levenshtein Distance (Edit Distance)

**Geometry Algorithms:**

- [ ] Convex Hull (Graham Scan, Jarvis March)
- [ ] Line Intersection
- [ ] Polygon Triangulation

**Numerical Algorithms:**

- [x] #8
- [ ] Primality Testing (Sieve of Eratosthenes, Miller-Rabin)
- [ ] Fast Exponentiation (Modular Exponentiation)

The main file paths where these functions are likely to be added are:

pyds_a/algorithms/

stick of snake case for file and folder names

Please keep in mind that the proper way to link an issue to this list is to comment:

```mackdown
- [ ] #issue_number
```
where `#issue_number` refers to the issue number for the task related to the specific subtask you've chosen. Make sure that the issue's title only includes the name of the function you've chosen.

贡献指南

打开贡献指南

评估

这个 Issue 还没有评估数据。

把新 issue 发到你的邮箱

精选适合新手参与的 GitHub issue 摘要。