Purely Functional Algorithms and Data Structures in Scala
Switch branches/tags
Nothing to show
Clone or download
Latest commit c0264a2 Mar 20, 2018
Failed to load latest commit information.
src Bugfix for #30 (#31) Dec 26, 2017
README.md Update README.md Mar 20, 2018


Why Scalacaster?

Join the chat at https://gitter.im/vkostyukov/scalacaster

Since Fender Stratocaster is a classic guitar, Scalacaster is about classic algorithms and data structures in Scala. Scalacaster includes loads of widely used implementation techniques and approaches, which have been developed by best programmers and enthusiasts of functional programming. Studying purely functional data structures is always fun and challenge for researchers, since data structures in a functional setting are much elegant and smarter than in an imperative setting.

How to use Scalacaster?

Scalacaster is neither a library nor framework. Moreover, Scalacaster`s code is not supposed to be executed at all. Scalacaster's code is not for Scala compiler but for human beings, for enthusiasts and researchers of the Scala programming language and its application in the area of implementation of the purely functional data structures. So, the best way to use Scalacaster is to read through its source code and comments.

What is inside?

Primitive routines
Simple Collections
Sorting Algorithms
Searching Algorithms

How to contribute?

  • Give it a star
  • Drop the feedback to the author @vkostyukov
  • Send a PR with fixes of typos/bugs/etc

What to read next?

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.