#### 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

# Exponential search

Like jump search, this is also a modified version of the linear search algorithm. It works as follows:

1. Step 1: We jump to indexes exponentially. Here, the jump step would be 1, 2, 4, 8, 16,...,i/2, i, 2i, 4i,... Notice that this is the same as jump search.
2. Step 2: We keep on jumping the steps exponentially until we get a value greater than the search element. Notice that this is also the same as we did in jump search.
3. Step 3: Once we get a value greater than the search element (for example, at the i index), we are sure that the search element is between the i/2th and ith index. Notice that this is also the same as jump search.
4. Step 4: Now do a binary search between these two indexes.

As all the steps followed here are similar to the jump search technique (except the last one, where we do a binary search instead), use any of the existing examples and perform...