Book Image

Hands-On Data Structures and Algorithms with Kotlin

By : Chandra Sekhar Nayak, Rivu Chakraborty
Book Image

Hands-On Data Structures and Algorithms with Kotlin

By: Chandra Sekhar Nayak, Rivu Chakraborty

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.
Table of Contents (16 chapters)
Free Chapter
Section 1: Getting Started with Data Structures
Section 2: Efficient Grouping of Data with Various Data Structures
Section 3: Algorithms and Efficiency
Section 4: Modern and Advanced Data Structures

Introducing Linked Lists

So far, we've looked at using an array when several items need to be grouped together. But arrays weren't enough to fulfill all of our engineering problems. In most cases, we weren't aware of the number of items we want to group together. So, similar to the saying, necessity is the mother of invention, we created a data structure by wrapping an array into a custom class and making it grow able when required. This helped us in grouping multiple items without even knowing their size. We called them Vector or ArrayList. Though our size requirements are solved by ArrayList, we've a basic problem in ArrayList and that is its performance while inserting. If the ArrayList is full and we try to insert an item, we need to create a bigger array and copy all existing items to the new one, which might take more time if the size is big. This is...