Implement Stacks, Queues, Dictionaries, and Lists in Your Apps
Buch, Englisch, 208 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 347 g
ISBN: 978-1-4842-5768-5
Verlag: Apress
Control the performance and stability of the apps you develop in Swift by working with and understanding advanced concepts in data structures and algorithms.
All professional developers have to know which data structure and algorithms to use in their development process. Your choice directly affects the performance of your application. With this book, you’ll increase the performance of your software, become a better developer, and even pass tricky interview questions better when looking at professional development opportunities.
Guided by compact and practical chapters, you'll learn the nature and proper use of data structures such as arrays, dictionaries, sets, stacks, queues, lists, hash tables, trie, heaps, binary trees, red black trees, and R-trees. Use the main differences among them to determine which will make your applications efficient and faster. Then tackle algorithms. Work with Big O notation; sorting algorithms such as Insertion, Merge, and Quick; Naive and Rabin Karp algorithms; and Graph Algorithms.
Data Structures and Algorithms in Swift encourages you to further and understand how to best choose the perfect algorithm for your application’s needs.
Who This Book Is ForDevelopers who have intermediate knowledge in Swift and want to improve their code performance and pass more complex interviews
All professional developers have to know which data structure and algorithms to use in their development process. Your choice directly affects the performance of your application. With this book, you’ll increase the performance of your software, become a better developer, and even pass tricky interview questions better when looking at professional development opportunities.
Guided by compact and practical chapters, you'll learn the nature and proper use of data structures such as arrays, dictionaries, sets, stacks, queues, lists, hash tables, trie, heaps, binary trees, red black trees, and R-trees. Use the main differences among them to determine which will make your applications efficient and faster. Then tackle algorithms. Work with Big O notation; sorting algorithms such as Insertion, Merge, and Quick; Naive and Rabin Karp algorithms; and Graph Algorithms.
Data Structures and Algorithms in Swift encourages you to further and understand how to best choose the perfect algorithm for your application’s needs.
What You'll Learn
- Retrieve, add, and remove elements in arrays
- Implement stacks, queues, and lists in your apps
- Sort algorithms and choose the best ones for your apps
Who This Book Is ForDevelopers who have intermediate knowledge in Swift and want to improve their code performance and pass more complex interviews
Karimov
Data Structures and Algorithms in Swift jetzt bestellen!
Zielgruppe
Professional/practitioner
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
Data Structures and Algorithms in Swift
Chapter 1: Arrays
Chapter 2: Dictionaries
Chapter 3: Sets
Chapter 4: Stacks
Chapter 5: Queues
Chapter 6: Linked Lists
Chapter 7: Hash Tables
Chapter 8: Trees
Chapter 9: Tree Data Structures
Chapter 10: Binary Trees
Chapter 11: Binary Search Trees
Chapter 12: Red Black Trees
Chapter 13: Big O Notations
Chapter 14: Sorting Algorithms
Chapter 15: Search Algorithms
Chapter 16: Graph Algorithms
Chapter 17: Choosing the Best AlgorithmBitte ändern Sie das Passwort
