Overview of this book

Data structures and algorithms are more than just theoretical concepts. They help you become familiar with computational methods for solving problems and writing logical code. Equipped with this knowledge, you can write efficient programs that run faster and use less memory. Hands-On Data Structures and Algorithms with Kotlin book starts with the basics of algorithms and data structures, helping you get to grips with the fundamentals and measure complexity. You'll then move on to exploring the basics of functional programming while getting used to thinking recursively. Packed with plenty of examples along the way, this book will help you grasp each concept easily. In addition to this, you'll get a clear understanding of how the data structures in Kotlin's collection framework work internally. By the end of this book, you will be able to apply the theory of data structures and algorithms to work out real-world problems.
Preface
Free Chapter
Section 1: Getting Started with Data Structures
A Walk Through - Data Structures and Algorithms
Arrays - First Step to Grouping Data
Section 2: Efficient Grouping of Data with Various Data Structures
Understanding Stacks and Queues
Maps - Working with Key-Value Pairs
Section 3: Algorithms and Efficiency
Deep-Dive into Searching Algorithms
Understanding Sorting Algorithms
Section 4: Modern and Advanced Data Structures
Collections and Data Operations in Kotlin
Introduction to Functional Programming
Other Books You May Enjoy
Assessments

Summary

So far, we have learned two different implementation of Map (HashMap and ArrayMap). Now, when to use what is an obvious question. To answer that, we have to remember how they work. As we know, HashMap requires more memory than ArrayMap, so we choose HashMap if memory is a constraint for us. Is memory the only parameter you should consider? Of course not. You are using these data structures to do some operations on them. We know that for the put operation in ArrayMap, we need to allocate new arrays and do the array copy operation, so it is a heavier operation in ArrayMap than in HashMap. The same thing applies with the remove operation, but the get (fetch) operation in ArrayMap is faster than HashMap as it uses binary search. So, we can conclude that if more operation is get (non mutable), then use ArrayMap; otherwise use HashMap.

 Work HashMap ArrayMap Memory More...