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 the bubble sort algorithm

This is the simplest sorting algorithm. In this algorithm, we just go through each item in the collection, compare two adjacent items, and swap them if they are not in the required order. We do this repetitively until no swaps are required.

You can consider this as one of the brute force techniques for sorting a collection. The complexity of this algorithm is O(n2) and it is considered one of the slowest sorting algorithms. The only reason we can use this algorithm is its simple implementation.

How the bubble sort algorithm works

Bubble sort simply traverses the collection and compares the adjacent elements to check whether they are in the right order or not. If they are in the proper...