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

Heap sort can be imagined as an improved version of selection sort. Like selection sort, this also has two sub-collections (a sorted one and an unsorted one). Initially, the unsorted sub-collection is the input collection, whereas the sorted sub-collection is empty. During the process, it tries to remove elements one by one from the unsorted sub-collection and adds them into the sorted sub-collection. Though the concept of sorting is similar to selection sort, the way it does it's different from selection sort. Its performance is O(n log n).

# A basic introduction to heap

We know that heap sort is based on the heap data structure, so it's wise to have a basic understanding of heap data structure...