Scala’s functionalprogramming features are a boon to help you design “easy to reasonabout” systems to control growing software complexities.
Inthis course, you will look at some classic simple algorithms. Mostalgorithms are traditionally defined in an imperative manner, typicallyconsisting of repetitions in the form of conditional looping andaltering states. Writing these in a functional manner is not always atrivial process. Moving ahead, you will learn to implement theseelementary algorithms using a combination of functional concepts insteadof the traditional imperative approach. After covering the importantfunctional concepts in Scala you will move on to the decimal to binaryconversion and generate sequences algorithms. Further, we will look atimplementing a series of algorithms such as generating prime numbers,divide and conquer, greedy algorithms, and functional infix to postfixconversion.
By the end of this course, you will be well versed in the functional concepts of Scala and would have implemented all of these.
About the Author :
James Cutajar is a software developer with interests in scalable high performance computing and distributed algorithms. He is also an open source contributor, blogger, and tech evangelist. When he is not writing software, he is riding his motorbike, surfing, or flying light aircraft. He was born in Malta, lived for almost a decade in London, and is now working in Portugal.
Learn Python like a Professional Start from the basics and go all the way to creating your own applications and games
4.6
★★★★★ 4.6/5
1,474,038 students
