پیشنهاد فرادرس

آموزش الگوریتم های مرتب سازی و جستجو در اسکالا

دسته بندی ها: آموزش اسکالا (Scala) ، آموزش های Packtpub ، الگوریتم و فلوچارت

در این دوره با مفاهیم و ابزار موجود در زبان اسکالا، با استفاده از برخی از الگوریتم های مرتب سازی و جستجو، پیاده سازی ساختارهای داده جستجو به شیوه ای کاربردی و غیر قابل تغییر، مرتب سازی تعداد، جستجوهای زیر رشته، جداول هش، درختان باینری و نزدیکترین الگوریتم جفت، Bubble Sort، مرتب سازی ادغام، جستجوی رشته Knuth-Morris-Pratt، توزیع ساختاری در ساختار داده های تابعی و مشکلات مختلف با ساختارهای داده های تغییرناپذیر و غیره آشنا می شوید.

سرفصل:

  • معرفی دوره
  • Bubble Sort
  • پیاده سازی Bubble Sort
  • پیاده سازی Merge Sort
  • جستجوهای زیر رشته یا Substring Searching
  •  Substring Searching چیست؟
  • Naive Searching
  • الگوریتم Knuth Morris Pratt
  • تطابق KMP در اسکالا
  • جداول هش
  • Hash Table API
  • درختان باینری
  • درختان باینری تغییرناپذیر
  • و غیره
به این نوشته امتیاز دهید 1 2 3 4 5 بدون امتیاز
Sorting and Searching Algorithms in Scala [Integrated Course] Publisher:Packtpub Author:James Cutajar Duration:5 hours and 16 minutes

Learn functional programming in Scala by implementing sorting and searching algorithms
Scala'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.
Key Features
Learn functional programming in Scala via examples
Discuss the advantages of developing algorithms in a functional manner.
Reinforce your knowledge using assessments and quizzes
Verify the concepts learned via an end-of-the-course practical project
Who this course is for
This course is aimed at intermediate Scala developers who want to learn in depth about functional programming concepts in Scala. This course will help intermediate developers understand some of the more complex Scala tools by practising with searching and sorting algorithms and their functional implementations.
Released: Friday, June 29, 2018
Number Sorting
The Course Overview
Can Sorting Be Functional
Bubble Sort
Bubble Sort Implementation
Merge Sort
Merge Sort Implementation
Substring Searching
What Is Substring Searching
Naive Searching
Naive Searching Implementation
Functional Naive Searching
Knuth Morris Pratt Algorithm
KMP Matching in Scala
KMP Prefix Table in Scala
Hash Tables
Introduction to Hash Tables
Collisions and Hashing
Hash Table API
Mutable Hash Table
Persistent Hash Tables
KMP Matching in Scala
Binary Trees
Introduction to Binary Trees
Immutable Binary Trees
Binary Search Implementation
Binary Insert Implementation
Traversal on Binary Trees
Traversal Implementation
Red Black Tree
Implementing Tree Rotations
Red Black Tree Insert
Implementing Red Black Tree Inserts
Closest Pair
Problem Introduction
Algorithm for 1 Dimension
Implementation for 1 Dimension
Algorithm for 2 Dimensions
2-Dimensional Implementation

پیشنهاد فرادرس