by James Cutajar | Released June 2018 | ISBN: 9781788476850

Learn functional programming in Scala by implementing sorting and searching algorithmsAbout This VideoLearn functional programming in Scala via examplesDiscuss the advantages of developing algorithms in a functional manner.Reinforce your knowledge using assessments and quizzesVerify the concepts learned via an end-of-the-course practical projectIn DetailScala's functional programming features are a boon when it comes to designing easy-to-reason-about systems to curb growing software complexities. In this course, we will learn about many concepts and tools available in the Scala language by implementing, in a functional manner, some sorting and searching 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 do just that. We will also show how to implement search data structures in a functional and immutable manner. We will look at number sorting, substring searches, hash tables, red black binary trees, and the closest pair algorithm. Along the way, we will talk about bubble sort, merge sort, Knuth-Morris-Pratt string searching, structural sharing in functional data structures, and various problems with immutable data structures. Further, we will explore the classic closest pair algorithm and show how we can solve the problem efficiently in a functional manner.By the end of the course, you will have gained a thorough knowledge of many functional Scala concepts and will understand these algorithms and data structures.All the code and supporting files for this course are available at https://github.com/PacktPublishing/Sorting-and-Searching-Algorithms-in-Scala. Show and hide more

1. Chapter 1 : Number Sorting
   • The Course Overview 00:03:52
   • Can Sorting Be Functional 00:11:00
   • Bubble Sort 00:04:00
   • Bubble Sort Implementation 00:11:37
   • Merge Sort 00:08:33
   • Merge Sort Implementation 00:14:20
2. Chapter 2 : Substring Searching
   • What Is Substring Searching 00:03:58
   • Naive Searching 00:04:06
   • Naive Searching Implementation 00:10:00
   • Functional Naive Searching 00:10:49
   • Knuth Morris Pratt Algorithm 00:12:30
   • KMP Matching in Scala 00:11:02
   • KMP Prefix Table in Scala 00:12:39
3. Chapter 3 : Hash Tables
   • Introduction to Hash Tables 00:04:23
   • Collisions and Hashing 00:07:20
   • Hash Table API 00:10:13
   • Mutable Hash Table 00:11:34
   • Persistent Hash Tables 00:08:46
   • KMP Matching in Scala 00:10:07
4. Chapter 4 : Binary Trees
   • Introduction to Binary Trees 00:07:12
   • Immutable Binary Trees 00:07:13
   • Binary Search Implementation 00:11:20
   • Binary Insert Implementation 00:10:41
   • Traversal on Binary Trees 00:05:26
   • Traversal Implementation 00:13:26
   • Red Black Tree 00:07:34
   • Implementing Tree Rotations 00:07:12
   • Red Black Tree Insert 00:09:15
   • Implementing Red Black Tree Inserts 00:18:09
5. Chapter 5 : st Pair
   • Problem Introduction 00:04:47
   • Algorithm for 1 Dimension 00:07:53
   • Implementation for 1 Dimension 00:14:43
   • Algorithm for 2 Dimensions 00:09:45
   • 2-Dimensional Implementation 00:11:32
Show and hide more