Skip to content

Repertoire of datastructures and utilities for competitive programming in Scala

License

Notifications You must be signed in to change notification settings

FlorianCassayre/competitive-scala

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

48 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

competitive-scala

My personal repertoire of datastructures and utilities written in pure Scala.

  • All implementations are pure, with the exception of randomized algorithms which rely on an impure random number generator oracle.
  • All implementations are asymptotically optimal up to a log^k(n) factor. Most of the time the chosen algorithm is indeed optimal, however the operations on the underlying immutable datastructures may require additional time (compared to their impure counterpart), thus the log factor.
  • All implementations are self-contained: no external libraries are used and files are isolated from each other.

Repertoire

Geometry

Graphs

Number theory

Arrays, sequences and strings

Other utilities

About

Repertoire of datastructures and utilities for competitive programming in Scala

Topics

Resources

License

Stars

Watchers

Forks

Languages