The repository is a collection of a variety of algorithms implemented in C#. The algorithms span over a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc. The implementations and their associated documentations are meant to provide a learning resource for educators and students. Hence, one may find more than one implementation for the same objective but using different algorithm strategies and optimizations.
- Algorithms
- Crypto
- Data Compression
- Encoders
- Graph
- Knapsack problem
- Linear Algebra
- Modular Arithmetic
- Numeric
- Absolute
- Addition Without Arithmetic
- Aliquot Sum Calculator
- Amicable Numbers Checker
- Ceil
- Decomposition
- Floor
- Greatest Common Divisor
- Factorization
- Modular Exponentiation
- Series
- Gauss-Jordan Elimination
- BinomialCoefficient
- Factorial
- Keith Number Checker
- Pseudo-Inverse
- Narcissistic Number Checker
- Perfect Cube Checker
- Perfect Number Checker
- Perfect Square Checker
- Euler Method
- Classic Runge-Kutta Method
- Miller-Rabin primality check
- KrishnamurthyNumberChecker
- Automorphic Number
- Josephus Problem
- Newton's Square Root Calculation
- SoftMax Function
- RecommenderSystem
- Machine Learning
- Searches
- Sorts
- Shufflers
- Sequences
- A000002 Kolakoski
- A000004 Zero
- A000005 Count of Divisors
- A000008 Make Change
- A000010 Euler's Totient
- A000012 All Ones
- A000027 Natural
- A000032 Lucas Numbers
- A000040 Primes
- A000045 Fibonacci
- A000079 Powers of 2
- A000108 Catalan
- A000120 1's Counting
- A000124 Central Polygonal Numbers
- A000125 Cake Numbers
- A000142 Factorial
- A000213 Tribonacci Numbers
- A000215 Fermat Numbers
- A000288 Tetranacci Numbers
- A000290 Squares
- A000292 Tetrahedral numbers
- A000578 Cubes
- A000720 PrimePi
- A001146 Number of Boolean Functions
- A001462 Golomb's
- A001478 Negative Integers
- A002110 Primorial Numbers
- A002717 Matchstick Triangle Arrangement
- A005132 Recaman's
- A006577 Number of '3n+1' steps to reach 1
- A006862 Euclid Numbers
- A006879 Number of Primes by Number of Digits
- A006880 Number of Primes by Powers of 10
- A007318 Binomial
- A007395 All Twos
- A010051 Binary Prime Constant
- A010701 All Threes
- A011557 Powers of 10
- A057588 Kummer Numbers
- A019434 Fermat Primes
- A181391 Van Eck's
- Stack
- String
- Other
- Fermat Prime Checker
- Sieve of Eratosthenes
- Kadane's Algorithm
- Luhn
- Int2Binary
- GeoLocation
- Mandelbrot
- Koch Snowflake
- RGB-HSV Conversion
- Flood Fill
- Pareto Optimization
- Gauss Optimization
- Decisions Convolutions
- Welford's Variance
- Julian Easter
- Pollard's Rho
- GeoLocation Hash
- Geofencing
- Triangulation Algorithm
- Problems
- Data Structures
- Bag
- Bit Array
- Deque (Double-Ended Queue)
- Timeline
- Segment Trees
- Binary Search Tree
- Scapegoat Tree
- Fenwick tree (or Binary Indexed Tree)
- AA Tree
- AVL Tree
- B-Tree
- Red-Black Tree
- Stack
- Heap
- Probabilistic
- Queue
- Linked List
- Graph
- Disjoint Set
- SortedList
- Inverted index
- Unrolled linked list
- Tries
- HashTable
- Cache
As part of our continuous effort to stay up-to-date with the latest technologies, we have migrated our project to .NET 8. This upgrade enhances our project with the latest features and improvements from the .NET ecosystem.
- To build and run this project, .NET 8 SDK is now required.
- Ensure your development tools are compatible with .NET 8.
- With .NET 8 SDK installed, you can build the project using the standard
dotnet buildcommand. - All existing build scripts have been updated to accommodate the .NET 8 SDK.
- Our comprehensive suite of unit tests ensures compatibility with .NET 8.
- Run tests using the
dotnet testcommand as usual.
You can contribute with pleasure to this repository. Please orient on the directory structure and overall code style of this repository and refer to our contributing guidelines for more details. If you want to ask a question or suggest something, please open an issue.