Scalacaster

Since Fender Stratocaster is a classic guitar, Scalacaster is 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 chalange for researchers. Data structures in a functional setting are much elegant and witty than in an imperative setting. And if you catch the glimpse of its beauty, Scalacaster will show you an awesome duo of breathtaking Scala syntax and amazing functional data structures.

Primitive routines

• Numbers theory src/primitive/Numbers.scala
• Strings src/primitive/Strings.scala

Simple Collections

• List src/collection/List.scala
• Queue src/collection/Queue.scala
• Stack src/collection/Stack.scala
• Heap src/collection/Heap.scala
• Set src/collection/Set.scala

Trees

• Binary Search Tree src/tree/Tree.scala
• Red-Black Tree src/tree/RBTree.scala

Graphs

• Graph src/graph/Graph.scala
• InductiveGraph src/graph/InductiveGraph.scala

Sorting Algorithms

• Quick Sort src/sort/QuickSort.scala
• Merge Sort src/sort/MergeSort.scala
• Bubble Sort src/sort/BubbleSort.scala
• Insertion Sort src/sort/InsertionSort.scala
• Selection Sort src/sort/SelectionSort.scala

Searching Algorithms

• Selection Search (k-th order statistic) src/search/SelectionSearch.scala
• Binary Search src/search/BinarySearch.scala
• Linear Search src/search/LinearSearch.scala

---

by Vladimir Kostyukov, 2013