Scala's functional programming features are a boon to help you design “easy to reason about” systems to control growing software complexities.
In this course, you will look at some classic simple algorithms. Most algorithms are traditionally defined in an imperative manner, typically consisting of repetitions in the form of conditional looping and altering states. Writing these in a functional manner is not always a trivial process. Moving ahead, you will learn to implement these elementary algorithms using a combination of functional concepts instead of the traditional imperative approach. After covering the important functional concepts in Scala you will move on to the decimal to binary conversion and generate sequences algorithms. Further, we will look at implementing a series of algorithms such as generating prime numbers, divide and conquer, greedy algorithms, and functional infix to postfix conversion.
By the end of this course, you will be well versed in the functional concepts of Scala and would have implemented all of these.
What You Will Learn
- Learn decimal to binary and implement it in a functional form
- Generate sequences using streams
- Generate Fibonacci sequences the functional way
- Understand the process to choose the right algorithm for the right usecase
- Understand the usefulness of pattern matching
- Generate prime numbers using the functional pattern
This course is aimed at Scala beginners and enthusiasts who want to get started with Scala's functional programming concepts. This course will allow newbie developers to understand classic algorithms and implement the functional approach to solve them.
About The Author
James Cutajar: James Cutajar is a software developer with an interest in scalable, high-performance computing, and distributed algorithms. He is also an author, open source contributor, blogger, and a tech evangelist. When he is not writing software, he is riding his motorbike, surfing, or flying light aircraft. He was born in Malta, lived in London for almost a decade, and is now working in Portugal.
Table of contents
- Chapter 1 : Being Functional
- Chapter 2 : Decimal to Binary
- Chapter 3 : Sequences
- Chapter 4 : Greedy Algorithms
- Chapter 5 : The Shunting Yard Algorithm
- Chapter 6 : Prime Numbers
- Chapter 7 : Divide and Conquer
- Title: Fundamental Algorithms in Scala
- Release date: December 2017
- Publisher(s): Packt Publishing
- ISBN: 9781788474887
You might also like
The Complete Coding Interview Guide in Java
Explore a wide variety of popular interview questions and learn various techniques for breaking down tricky …
Java Coding Problems
Develop your coding skills by exploring Java concepts and techniques such as Strings, Objects and Types, …
Full Stack Web Development Mastery Course - Novice to Expert
Full stack development refers to the development of both frontend (client-side) and backend (server-side) portions of …
React - The Complete Guide (Includes Hooks, React Router, and Redux) - Second Edition
**This course is now updated for the latest version of React—React 18** React.js is the most …