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

Selection sort performs with the same complexity to bubble sort. Its complexity is also O(n2).

# How the selection sort algorithm works

This works exactly the opposite as bubble sort, in terms of ordering the elements. Bubble sort sorts one element at every iteration and freezes its index toward the end of the collection. In contrast to that, selection sort sorts one element at every iteration and freezes its index toward the start of the collection.

You can imagine it as two subarrays, one sorted and another unsorted. In the beginning, the sorted subarray is empty and the unsorted subarray is the whole array given as input. To do this, it finds the smallest element (or the largest, if sorting in...