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
1
Section 1: Getting Started with Data Structures
4
Section 2: Efficient Grouping of Data with Various Data Structures
8
Section 3: Algorithms and Efficiency
11
Section 4: Modern and Advanced Data Structures
15
Assessments

Introduction to arrays

Being a basic data structure, every language supports creating an array. When we talk about Kotlin, an array here's represented by a class called Array present in a kotlin package. Like other classes, it has a few member functions and properties. Let's see what it looks like using the following code:

class Array<T> private constructor() {
val size: Int
operator fun get(index: Int): T
operator fun set(index: Int, value: T): Unit

operator fun iterator(): Iterator <T>
// ...
}

In terms of the preceding code snippet of the Array class defined in the Kotlin core API, we can say that it has a size property to tell us the current size of the array; the get and set functions, which basically overload the [] operator; and an iterator function to let us iterate over the items.

So, using the preceding mentioned properties, we...