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, we 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. In this course, we will show how these elementary algorithms can be implemented using a combination of functional concepts instead of the traditional imperative manner. We will start with an introduction to the functional concepts in Scala and then move on to the decimal to binary conversion and generating sequences algorithms. Further, we will look at implementing a number 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.

Key Features

• Install Scala and get started with using it (IDE and REPL)
• Reinforce your knowledge using assessments and quizzes
• Verify the concepts learned through an end-of-the-course practical project

Who this course is for

This course is aimed for 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.