Skip to content

beaverden/Algorithms

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

61 Commits
.gitattributes
.gitattributes
 
 
.gitignore
.gitignore
 
 
BFS.cpp
BFS.cpp
 
 
BigInt.cpp
BigInt.cpp
 
 
Binary Power.cpp
Binary Power.cpp
 
 
BinaryTree.cpp
BinaryTree.cpp
 
 
Chess.cpp
Chess.cpp
 
 
Circle intersection.cpp
Circle intersection.cpp
 
 
ConvexHull.cpp
ConvexHull.cpp
 
 
DSU.cpp
DSU.cpp
 
 
Distance point line.cpp
Distance point line.cpp
 
 
Evaluator.cpp
Evaluator.cpp
 
 
Fractions.cpp
Fractions.cpp
 
 
GCD.cpp
GCD.cpp
 
 
Heap.cpp
Heap.cpp
 
 
Knapsack 0-1.cpp
Knapsack 0-1.cpp
 
 
Kosaraju (SCC).cpp
Kosaraju (SCC).cpp
 
 
LinkedList.cpp
LinkedList.cpp
 
 
Long Addition.cpp
Long Addition.cpp
 
 
Long Division.cpp
Long Division.cpp
 
 
Long Product.cpp
Long Product.cpp
 
 
Long Substraction.cpp
Long Substraction.cpp
 
 
Lower bound.cpp
Lower bound.cpp
 
 
Map.cpp
Map.cpp
 
 
MatrixBinaryExp.cpp
MatrixBinaryExp.cpp
 
 
Max Segment Tree.cpp
Max Segment Tree.cpp
 
 
MergeSort.cpp
MergeSort.cpp
 
 
Modular division.cpp
Modular division.cpp
 
 
Number System Converter.cpp
Number System Converter.cpp
 
 
Polygon Area.cpp
Polygon Area.cpp
 
 
Polynomial multiply.cpp
Polynomial multiply.cpp
 
 
Quadratic Ecuation Solver.cpp
Quadratic Ecuation Solver.cpp
 
 
Queue.cpp
Queue.cpp
 
 
QuickSort.cpp
QuickSort.cpp
 
 
README.md
README.md
 
 
Red black tree.cpp
Red black tree.cpp
 
 
Segment Tree.cpp
Segment Tree.cpp
 
 
Sieve of Eratosthenes.cpp
Sieve of Eratosthenes.cpp
 
 
SquareRoot.cpp
SquareRoot.cpp
 
 
Stack.cpp
Stack.cpp
 
 
Stirling Number of the second kind.cpp
Stirling Number of the second kind.cpp
 
 
Subfactorial.py
Subfactorial.py
 
 
Trie.cpp
Trie.cpp
 
 
Upper Bound.cpp
Upper Bound.cpp
 
 
Vector.cpp
Vector.cpp
 
 

Repository files navigation

Algorithms

Some template algorithms for competitive programming

Please note that most of them are my implementations based on the examples, videos, courses from the whole internet. I cannot assure anyone that those algorithm implementations are completly working in any situations, although I can state that practiacally all of them have been tested on real problems with strong and comprehensive tests.

Language - C++, Python

Current list of algorithms included

  • Data structures

    • Generic LinkedList
    • Queue
    • Stack
    • Red Black Tree
    • Genetic <Key, Value> Map
    • Segment Tree
    • Genetic Vector (close to STL implementation)
    • Disjoint Set Union (DSU)
    • BinaryTree
    • Heap
    • Trie

  • BigInteger Library in one file (please consider that some of the functions work with ARRAYS, so you might want to keep in mind the length of the numbers that you're trying to fit in)

    • Addition
    • Division
    • Product
    • Substraction
    • Modulus
    • GCD
    • LCM

  • Algorithms

    • Convex Hull (Jarvis Algorithm)

  • Chess functions (Checks if a certain figure can move from A to B in one move)

    • Bishop
    • Knight
    • Queen
    • Rook
    • Pawn
    • King
    • Cell color

  • Sorting

    • Quicksort
    • MergeSort

  • Divide and conquer finding

    • Lower bound
    • Upper bound

  • Math

    • Binary powering
    • Quadratic equation solver
    • Polygon area
    • Converter from number system X to Y
    • Polymonial multiply
    • Stirling numbers of the second kind
    • Class for expression evaluation
    • Subfactorial (.py)
    • Fractions class
    • Sieve of Eratosthenes (primes)
    • Circle intersection area
    • Distance point-segment
    • Modular divide

  • Graph theory

    • BFS
    • Kosaraju algorithm for SCC

  • Knapsack 0-1

About

Some template algorithms for competitive programming

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages