Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Hands-On Data Structures and Algorithms with Kotlin

You're reading from   Hands-On Data Structures and Algorithms with Kotlin Level up your programming skills by understanding how Kotlin's data structure works

Arrow left icon
Product type Paperback
Published in Feb 2019
Publisher Packt
ISBN-13 9781788994019
Length 220 pages
Edition 1st Edition
Languages
Arrow right icon
Authors (2):
Arrow left icon
Chandra Sekhar Nayak Chandra Sekhar Nayak
Author Profile Icon Chandra Sekhar Nayak
Chandra Sekhar Nayak
Rivu Chakraborty Rivu Chakraborty
Author Profile Icon Rivu Chakraborty
Rivu Chakraborty
Arrow right icon
View More author details
Toc

Table of Contents (16) Chapters Close

Preface 1. Section 1: Getting Started with Data Structures FREE CHAPTER
2. A Walk Through - Data Structures and Algorithms 3. Arrays - First Step to Grouping Data 4. Section 2: Efficient Grouping of Data with Various Data Structures
5. Introducing Linked Lists 6. Understanding Stacks and Queues 7. Maps - Working with Key-Value Pairs 8. Section 3: Algorithms and Efficiency
9. Deep-Dive into Searching Algorithms 10. Understanding Sorting Algorithms 11. Section 4: Modern and Advanced Data Structures
12. Collections and Data Operations in Kotlin 13. Introduction to Functional Programming 14. Other Books You May Enjoy 15. Assessments

Introduction to collections

In programming, the word "framework" generally refers to a structure underlying a system that can be used within the system to perform a set of similar operations. Thus, we can think of a framework as a collection of libraries/APIs.

Similarly, the collections framework provides developers with a set of APIs to perform common data/data structure-related operations (which can be called data operations). The collections framework contains a few of the most commonly needed interfaces to deal with data structures and their common concrete implementations. You can always create your own custom implementation of a Collection interface. The collections framework also defines the most common algorithms, including the following:

  • Searching
  • Sorting
  • Insertion
  • Deletion
  • Manipulation

All the lists, maps, and sets we use in our programs every day are part...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at €18.99/month. Cancel anytime