The Algorithms - C#

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

Overview

• Algorithms

  • Data Compression
    • Burrows-Wheeler transform
    • Huffman Compressor
    • Shannon-Fano Compressor
  • Encoders
    • Caesar
    • Vigenere
    • Hill
  • Knapsack problem
    • Naive solver
    • Dynamic Programming solver
  • Numeric
    • Decomposition
      • LU
    • Greatest Common Divisor
      • Euclidean GCD
      • Binary GCD
    • Factorization
      • Trial division
    • Series
      • Maclaurin
    • Gauss-Jordan Elimination
  • Searches
    • A-Star
    • Binary
    • Recursive Binary
    • Linear
    • FastSearch
  • Sorts
    • Comparison
      • Binary Insertion
      • Bogo
      • Bubble
      • Cocktail
      • Comb
      • Cycle
      • Heap
      • Insertion
      • Merge
      • Pancake
      • Quick
      • Selection
      • Shell
    • External
      • Merge
    • Integer
      • Counting
      • Bucket
      • Radix
    • String
      • MSD Radix
  • Sequences
    • A000027 Natural
    • A000040 Primes
    • A000045 Fibonacci
  • String
    • Longest Consecutive Character
    • Naive String Search
    • Rabin Karp
    • Boyer Moore
    • Palindrome Checker
  • Other
    • Fermat Prime Checker
    • Sieve of Eratosthenes
  • Problems
    • Stable Marriage
      • Gale-Shapley

• Data Structures

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

Contribution

You can contribute with pleasure to this repository. Please orient on the directory structure and overall code style of this repository. If you want to ask a question or suggest something, please open an issue.