The Algorithms - C#

This repository contains algorithms and data structures implemented in C# for educational purposes.

Overview

• Algorithms

  • Data Compression
    • Burrows-Wheeler transform
    • Huffman Compressor
    • Shannon-Fano Compressor
  • Encoders
    • Caesar
    • Vigenere
    • Hill
    • NYSIIS
    • Soundex
  • Knapsack problem
    • Naive solver
    • Dynamic Programming solver
  • Linear Algebra
    • Eigenvalue
      • Power Iteration
  • Numeric
    • Aliquot Sum Calculator
    • Decomposition
      • LU Decomposition
      • Thin Singular Vector Decomposition
    • Greatest Common Divisor
      • Euclidean GCD
      • Binary GCD
    • Factorization
      • Trial division Factorization
    • Series
      • Maclaurin Series
    • Gauss-Jordan Elimination
    • Pseudo-Inverse
    • Narcissistic Number Checker
    • Perfect Number Checker
    • Perfect Square Checker
    • Euler Method
  • Searches
    • A-Star
    • Binary Search
    • Recursive Binary Search
    • Linear Search
    • Fast Search
  • Sorts
    • Comparison
      • Binary Insertion Sort
      • Bogo Sort
      • Bubble Sort
      • Cocktail Sort
      • Comb Sort
      • Cycle Sort
      • Heap Sort
      • Insertion Sort
      • Merge Sort
      • Pancake Sort
      • Quick Sort
        • Median of three pivot
        • Middle point pivot
        • Random pivot
      • Selection Sort
      • Shell Sort
    • External
      • Merge Sort
    • Integer
      • Counting Sort
      • Bucket Sort
      • Radix Sort
    • String
      • MSD Radix Sort
      • Knuth–Morris–Pratt Search
  • Sequences
    • A000027 Natural
    • A000040 Primes
    • A000045 Fibonacci
    • A000142 Factorial
    • A007318 Binomial
  • String
    • Longest Consecutive Character
    • Naive String Search
    • Rabin Karp
    • Boyer Moore
    • Palindrome Checker
  • Other
    • Fermat Prime Checker
    • Sieve of Eratosthenes
    • Luhn
    • Mandelbrot
    • Koch Snowflake
    • RGB-HSV Conversion
    • Flood Fill
  • Problems
    • Stable Marriage
      • Gale-Shapley
    • N-Queens
      • Backtracking

• Data Structures

  • Bit Array
  • Timeline
  • Segment Trees
    • Segment Tree
    • Segment Tree Multiplication
    • Segment Tree Update
  • Binary Search Tree
  • AA Tree
  • Stack
    • Array-based Stack
    • List-based Stack
  • Heap
    • Min-Max Heap
    • Binary Heap
    • Fibonacci Heap
  • Queue
    • Array-based Queue
    • List-based Queue
    • Stack-based Queue
  • Linked List
    • Singly Linked List
    • Doubly Linked List

Contributing

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 detail. If you want to ask a question or suggest something, please open an issue.