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

# Understanding the searching algorithm

To understand searching better, consider the following example.

Let's say that you've 500 students in your school. One day, your principal asks you to locate one student, but you've only been given some details about them. You can do this task in multiple ways. Let's explore a couple of possible approaches:

• Approach 1: You can go and visit each of the students and check if they are the student your principal has asked for. This will take quite a long time, as your search might end with the very last student.
• Approach 2: Instead of visiting each student randomly, you can check which class the student belongs to, and only visit the students from that class. This will significantly reduce your search time.

From the preceding two approaches, it's obvious that you'll always choose the second one because it significantly...