Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Implementation of popular algorithms and data structures using .NET Core

License

NotificationsYou must be signed in to change notification settings

Miltt/Console

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

GitHub release (latest by date)GitHub Workflow Statuslicense

Console

Implementation of popular algorithms and data structures using .NET Core

Getting Started

Prerequisites:

  • Install the latest version of.NET Core
  • Install the latest version ofVisual Studio Code orVisual Studio
  • Get the code:
    git clone https://github.com/Miltt/Console.git
  • Open the solution to build the applicationdotnet build and run testsdotnet test

Implemented

Algorithms

  • Cryptography
    • RSA
  • Dynamic Programming
    • Knapsack Problem
    • Fibonacci Number
    • Longest common subsequence problem
  • Greedy
    • Prims
  • Linear Programming
    • Simplex Algorithm
  • Miscellaneous
    • Lucky Tickets
    • Tower of Hanoi
    • Eight queens puzzle
    • Coin change problem
  • Multithreading
    • Dining Philosophers Problem
    • Readers Writers Problem
  • Number Theoretic
    • Prime
      • Primality Test
      • Sieve of Atkin
    • Exponentiation
      • Modular exponentiation
      • Exponentiation by squaring
      • Factorization
        • Trial division
        • Fermat's method
      • Greatest common divisor
        • Euclidean algorithm
        • Extended Euclidean algorithm
      • Multiplication
        • Recursive Naive
        • Peasant (Binary, Bitwise)
        • Karatsuba
  • Searching
    • Array
      • Binary
      • Linear
    • Graph
      • Breadth-first search
      • Depth-first search
      • Dijkstra
    • String
      • Knuth-Morris-Pratt
  • Simulated Annealing
    • Travelling salesman problem
  • Sorting (ascending and descending order)
    • Bubble
    • Cocktail
    • Gnome
    • Heap
    • Insertion
    • Merge
    • Quick
    • Selection
    • Shell

Data Structures

  • Graph
  • Heap
    • Binary
    • Binomial
  • Matrix
  • Tree
    • AVL
    • Red-black
  • Disjoint Set
  • Doubly Linked List
  • Dynamic Array
  • Hash Table
  • Immutable Stack
  • Lock-Free Stack

Design Patterns

  • Creational
    • Factory Method
  • Structural
    • Adapter
  • Behavioral
    • Strategy

License

Copyright (c) 2021 Ilya Moshanov

Licensed under theMIT License.

Packages

No packages published

Contributors2

  •  
  •  

Languages


[8]ページ先頭

©2009-2025 Movatter.jp