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?
- Standard Binary Heap
- Leftist Heap
- Pairing Heap
- Skew Heap
- Binary Search Tree
- Red-Black Tree
- AA Tree
- Quick Sort
- Merge Sort
- Bubble Sort
- Insertion Sort
- Selection Sort
- Selection Search (k-th order statistic)
- Binary Search
- Linear Search
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?
- Slides about Scalacaster
- Purely Functional Data Structures by Chris Okasaki
- What’s new in Purely Functional DS since Okasaki
- A Functional Approach to Standard Binary Heaps (see
- Combinatorial Algorithms in Scala
- Designing a Purely Functional Data Structure
- Functional Data Structures in Scala by Daniel Spiewak
This work is licensed under a Creative Commons Attribution 4.0 International License.