Sorting and Searching Algorithms in Scala [video], published by Packt This is the code repository for Sorting and Searching Algorithms in Scala [Video], published by Packt. It contains all the supporting project files necessary to work through the video course from start to finish.
The best way to learn any programming technology is to pick some well-defined problems and solve them using tools available in that technology. This course is about doing just that. Learn functional programming in Scala by exploring implementations of various algorithms and data structures. In this course, we explore several Scala features while implementing many searching and sorting algorithms and data structures. These include bubble and merge sort, KMP string searching, hash tables and balanced binary trees, and a detailed implementation of the closest pair algorithm.
- Understand and implement bubble sort and a functional merge sort
- Explore naive string searching and the more advanced KMP algorithm.
- Implement a purely functional hash table
- Learn about structural searching
- Master unbalanced binary and red-black trees and implement both in a functional manner
- Understand depth and breadth-first search traversal
- Implement an efficient solution for the closest pair problem.
To fully benefit from the coverage included in this course, you will need:
Beginner knowledge of Scala
What is a foldLeft()?
This course has the following software requirements:
Mac/Linux/Windows operating system
IDE such as Intellij or Eclipse
If you have already purchased a print or Kindle version of this book, you can get a DRM-free PDF version at no cost.
Simply click on the link to claim your free PDF.