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

Understanding Sorting Algorithms

Whenever we are dealing with a collection of data (whether a list or an array), we might need algorithms to sort the data in order to make other operations faster. For example, searching an element from a list or merging two lists into one work best when the lists are sorted. If the data is sorted, it also makes tasks such as generating human-readable reports easy.

There are many algorithms for sorting a list or an array. In this chapter, we'll try to explain a few of the most commonly used sorting algorithms and how they work internally. The algorithms we are going to discuss here are as follows:

  • Bubble sort
  • Selection sort
  • Insertion sort
  • Merge sort
  • Quick sort
  • Heap sort