Data Structures & Algorithms in Kotlin (First Edition): Implementing Practical Data Structures in Kotlin
Authors: raywenderlich Tutorial Team – Irina Galata – Matei Suica
ISBN-10: 1942878915
ISBN-13: 9781942878919
Released: 2019-10-01
Print Length 页数: 424 pages
Book Description
Learn Data Structures & Algorithms in Kotlin!
Data structures and algorithms are fundamental tools every developer should have. In this book,you’ll learn how to implement key data structures in Kotlin,and how to use them to solve a robust set of algorithms. This book is for intermediate Kotlin or Android developers who already know the basics of the language and want to improve their knowledge.
Topics Covered in This Book
Introduction to Kotlin: If you’re new to Kotlin,you can learn the main constructs and begin writing code.
Complexity: When you study algorithms,you need a way to compare their performance in time and space. Learn about the Big-O notation to help you do this.
Elementary Data Structures**: Learn how to implement Linked List,Stacks,and Queues in Kotlin.
Trees: Learn everything you need about Trees — in particular,Binary Trees,AVL Trees,as well as Binary Search and much more.
Sorting Algorithms: Sorting algorithms are critical for any developer. Learn to implement the main sorting algorithms,using the tools provided by Kotlin.
Graphs: Have you ever heard of Dijkstra and the calculation of the shortest path between two different points? Learn about Graphs and how to use them to solve the most useful and important algorithms.
Data Structures & Algorithms in Kotlin
Book License
Who This Book Is For
What You Need
Book Source Code && Forums
About the Cover
Section l: Introduction to Data Structures & Algorithms
Chapter 1: Kotlin & Kotlin Standard Library
Chapter 2: Complexity
Section ll: Elementary Data Structures
Chapter 3: Linked List
Chapter 4: Stack Data Structures
Chapter 5: Queues
Section ll: Trees
Chapter 6: . Trees
Chapter 7: Binary Trees
Chapter 8: Binary Search Trees
Chapter 9. AVL Trees
Chapter 10: Tries
Chapter 11: Binary Search
Chapter 12: The Heap Data Structure
Chapter 13: Priority Queues
Section IV: Sorting Algorithms
Chapter 14: O(n2) Sorting Algorithms
Chapter 15: Merge Sort
Chapter 16: Radix Sort
Chapter 17: Heap Sort
Chapter 18: Quicksort
Section V: Graphs
Chapter 19. Graphs
Chapter 20: Breadth-First Search
Chapter 21: Depth-First Search
Chapter 22: Dijkstra’s Algorithm
Chapter 23: Prim’s Algorithm
Conclusion
