English | MP4 | AVC 1920×1080 | AAC 48KHz 2ch | 3h 39m | 635 MB
Implement classic, simple algorithms using the functional approach in Scala
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.
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 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.
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
Table of Contents
01 The Course Overview
02 Why Functional
03 Getting Started with Scala
04 Scala in Your IDE
05 Scala in Action
06 Problem Explanation
07 Iterative Implementation
08 Functional Implementation
09 What Are Sequences
10 Implementations
11 Fibonacci Numbers
12 Streaming Fibonacci Numbers
13 Problem Explanation
14 Implementation
15 Functional Implementation
16 Problem Explanation
17 Infix to Postfix Implementation
18 Postfix Evaluation
19 Implementing Postfix Evaluation
20 Problem Explanation
21 Algorithms
22 Classic Implementation
23 Functional Implementation
24 Problem Explanation
25 Solutions
26 Brute Force Implementation
27 More Efficient Implementation
28 Kadane’s Algorithm
Resolve the captcha to access the links!