Key FeaturesThis book provides complete coverage of reactive and functional data structuresBased on the latest version of Java 9, this book illustrates the impact of new features on data structuresGain exposure to important concepts such as Big-O Notation and Dynamic ProgrammingBook DescriptionJava 9 has come out with several fantastic features including significant performance improvements, making it faster than ever. This book will teach you to organize data in an efficient way while exploiting the new features of Java 9 data structures. We will also cover classical, functional, and reactive data structures, giving you the ability to understand computational complexity, solve problems, and write efficient code.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 in recursion.We provide plenty of examples along the way to help you understand each concept. You will get the also get a clear picture of reactive programming, binary searches, sorting, search trees, undirected graphs, and a whole lot more.What you will learnUnderstand the fundamentals of algorithms, data structures, and measurement of complexityFind out what general purpose data structures are, including arrays, linked lists, double ended linked lists, and circular listsGet a grasp on the basics of abstract data types—stack, queue, and double ended queueSee how to use recursive functions and immutability while understanding and in terms of recursionHandle reactive programming and its related data structuresUse binary search, sorting, and efficient sorting—quicksort and merge sortWork with the important concept of trees and list all nodes of the tree, traversal of tree, search trees, and balanced search treesApply advanced general purpose data structures, priority queue-based sorting, and random access immutable linked listsGain a better understanding of the concept of graphs, directed and undirected graphs, undirected trees, and much moreAbout the AuthorDebasish Chawdhuri is an accomplished Indian software engineer working out of Pune. He has over 7 years of experience with Java. He has also written several articles on Java Code Geeks and his own personal blog.
Author: Debasish Chawdhuri