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

Understanding insertion sort

Insertion sort performs slightly better than the previously discussed algorithms. Its complexity is O(n2). Though it has the same complexity as bubble sort and selection sort, it sorts faster than both of these in most cases. One of the best use cases for using this algorithm is to sort a dynamic collection. If you have a dynamic collection where items will keep on getting added to it at runtime, it can be sorted very efficiently by using insertion sort as and when the item reaches.

How the insertion sort algorithm works

The insertion sort algorithm has two subarrays (one sorted and another unsorted). Initially, the sorted subarray has only one item (the item at the 0th index) and the unsorted...