Book Image

Java 9 Data Structures and Algorithms

By : Debasish Ray Chawdhuri
Book Image

Java 9 Data Structures and Algorithms

By: Debasish Ray Chawdhuri

Overview of this book

Java 9 Data Structures and Algorithms covers classical, functional, and reactive data structures, giving you the ability to understand computational complexity, solve problems, and write efficient code. This book is based on the Zero Bug Bounce milestone of Java 9. We start off with the basics of algorithms and data structures, helping you understand the fundamentals and measure complexity. From here, we introduce you to concepts such as arrays, linked lists, as well as abstract data types such as stacks and queues. Next, we’ll take you through the basics of functional programming while making sure you get used to thinking recursively. We provide plenty of examples along the way to help you understand each concept. You will also get a clear picture of reactive programming, binary searches, sorting, search trees, undirected graphs, and a whole lot more!

Related Content you might be interested in

Current Title:

Small book image
Java 9 Data Structures and Algorithms
Debasish Ray Chawdhuri
Apr, 2017 | 340 pages
Small book image
Beginning Java Data Structures and Algorithms
James Cutajar
Jul, 2018 | 202 pages
Small book image
Learning Functional Data Structures and Algorithms
Atul S Khot | Raju Kumar Mishra
Feb, 2017 | 318 pages
Small book image
Hands-On Data Structures and Algorithms with Python – Third Edition
Dr Basant Agarwal
Jul, 2022 | 496 pages
Table of Contents (19 chapters)
Java 9 Data Structures and Algorithms
Java 9 Data Structures and Algorithms
Credits
Credits
About the Author
About the Author
About the Reviewer
About the Reviewer
www.PacktPub.com
www.PacktPub.com
Customer Feedback
Customer Feedback
Preface
Preface
Free Chapter
1
Why Bother? – Basic
Why Bother? – Basic
The performance of an algorithm
Optimization of our algorithm
Fixing the problem with large powers
Summary
2
Cogs and Pulleys – Building Blocks
Cogs and Pulleys – Building Blocks
Arrays
Linked list
Doubly linked list
Circular linked list
Summary
3
Protocols – Abstract Data Types
Protocols – Abstract Data Types
Stack
Queue
Double ended queue
Summary
4
Detour – Functional Programming
Detour – Functional Programming
Recursive algorithms
Lambda expressions in Java
Functional data structures and monads
The concept of a monad
Analysis of the complexity of a recursive algorithm
Performance of functional programming
Summary
5
Efficient Searching – Binary Search and Sorting
Efficient Searching – Binary Search and Sorting
Search algorithms
Sorting
A problem with recursive calls
Summary
6
Efficient Sorting – quicksort and mergesort
Efficient Sorting – quicksort and mergesort
quicksort
mergesort
Complexity of any comparison-based sorting
The stability of a sorting algorithm
Summary
7
Concepts of Tree
Concepts of Tree
A tree data structure
The tree abstract data type
Binary tree
Summary
8
More About Search – Search Trees and Hash Tables
More About Search – Search Trees and Hash Tables
Binary search tree
Self-balancing binary search tree
Red-black tree
Hash tables
Summary
9
Advanced General Purpose Data Structures
Advanced General Purpose Data Structures
Priority queue ADT
Heap
Linked heap
Binomial forest
Sorting using a priority queue
In-place heap sort
Summary
10
Concepts of Graph
Concepts of Graph
What is a graph?
The graph ADT
Representation of a graph in memory
Traversal of a graph
Cycle detection
Spanning tree and minimum spanning tree
Finding the minimum spanning tree
Summary
11
Reactive Programming
Reactive Programming
What is reactive programming?
Producer-consumer model
Functional way of reactive programming
Summary
Index
Index

About the Author

Debasish Ray Chawdhuri is an established Java developer and has been in the industry for the last 8 years. He has developed several systems, right from CRUD applications to programming languages and big data processing systems. He had provided the first implementation of extensible business reporting language specification, and a product around it, for the verification of company financial data for the Government of India while he was employed at Tata Consultancy Services Ltd. In Talentica Software Pvt. Ltd., he implemented a domain-specific programming language to easily implement complex data aggregation computation that would compile to Java bytecode. Currently, he is leading a team developing a new high-performance structured data storage framework to be processed by Spark. The framework is named Hungry Hippos and will be open sourced very soon. He also blogs at http://www.geekyarticles.com/ about Java and other computer science-related topics.

He has worked for Tata Consultancy Services Ltd., Oracle India Pvt. Ltd., and Talentica Software Pvt. Ltd.

I would like to thank my dear wife, Anasua, for her continued support and encouragement, and for putting up with all my eccentricities while I spent all my time writing this book. I would also like to thank the publishing team for suggesting the idea of this book to me and providing all the necessary support for me to finish it.

Previous Section
Next Chapter