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


Linear data structures such as static or dynamic arrays are among those few data structures that are most preferred by many programmers. Though an array is linear and static in nature, by tweaking it for ourselves, we can create different types of data structures around arrays. In this chapter, we tweaked the same static array to create a dynamic array (Vector) and an immutable dynamic array (ImmutableList).

Since immutability is playing an important role in modern programming languages such as Kotlin, we cannot just blindly go ahead and use immutable data structures everywhere, as long as we aren't understand the difference between mutability and immutability.

We can implement any immutable data structure in two ways; the easiest way to implement an immutable data structure is to encapsulate the properties inside the class without using any public APIs to modify...