Greetings!
This is Hannah Nelson. The repository to which this message is attached is a storage for practice implementation of common algorithms. Each algorithm folder has a python implementation and a brief explanation of how the algorithm achieves its goal. Thats all there it to it!
Algorithms in this package are constructed to be readable rather than fast. All algorithms will meet the asempotic complexity of the intended algorithm but many optimizations which would be desired from a real hardware performance standpoint will not be considered. This repository relies on numpy for most of its numerical functions.
| Algorithm | location |
|---|---|
| Fast Fourier Transform | AlgorithmsPractice.FastTransform.FFT.ffft |
| Inverse Fast Fourier Transform | AlgorithmsPractice.FastTransform.FFT.ifft |
| QuickSort | AlgorithmsPractice.Sorts.quickSort.quick_sort |
| HeapSort | AlgorithmsPractice.Sorts.heapSort.heap_sort |
| InsertionSort | AlgorithmsPractice.Sorts.insertionSort.insertion_sort |
| A Star | AlgorithmsPractice.PathFinding.astar.AStar |
| BFS | AlgorithmsPractice.PathFinding.astar.BFS |
| Structure | location |
|---|---|
| Heap | AlgorithmsPractice.DataStructures.heap.Heap |
| Finite Graph | AlgorithmsPractice.PathFinding.finitegraph.FiniteGraph |
To test any given module use the following command:
python3 -m AlgorithmsPractice.<subpackage name>.<submodule name>
Example:
python3 -m AlgorithmsPractice.Sorts.module_heap_sort
Simplex method Quick Select Merge Sort Hyper Log Log A-B Tree (data structure) K-D Tree (data structure) Fibbonochi Heap (data structure) Hash Set (data structure) Hash Collection (data structure) AVL Tree (data structure) Order Statistic Tree Binary Feasibility Range Objective Tree (data structure) (possibly a special case of branch and bound?) Longest Shared Subsequence (2 list) (optimized dynamic programming) Longest Shared Subsequence (2 list) (Hunt–Szymanski Algorithm) Trie (data structure) Skip List (data structure) Order Statistic Skip List (data structure) Specific Permutation Iteration Algorithm (lexographic) Specific Permutation Iteration Algorithm (non- lexographic) Nth Combination Reserviour Sampling K Means Clusteruing Aglommerative Clustering Ford-Fulkerson Algorithm Prim-Jarnik Algorithm Treap (data structure) Strassen Algorithm Christofides Algorithm Newton Raphson Method Newton Gauss Algorithm Simulated Anealing Wave Function Collapse Algorithm Genetic Algorithm Lowest Power Identification via Ratio of least significant digit place to start of roundoff error. (personal experiment) State Space Solution Search Matrix Inverse Algorithm Power Iteration Algoirthm Reverse Power Iteration Algoirthm QR Algorithm Francis Algorithm Monty Carlo Matrix Inverse Algorithm Euler's Method Jump Flood Spectral Embedding Neuroevolution of Augmenting Topologies Inverse Distance Weighting Interpolation KNN KNN Interpolation Bilenear Interpolation Bicubic Interpolation Linear Regression Logistic Regression Red Black Tree Divide and Conquer Minimum Distance Algoirthm KNN graph construction FDCT DBSCAN
I hope you have a splendid day! Hannah Nelson 2024