finelybook![Java 9 Data Structures and Algorithms by [Chawdhuri,Debasish Ray]](https://images-eu.ssl-images-amazon.com/images/I/51P3xuHcqeL._SX260_.jpg)
Java 9 Data Structures and Algorithms
by Debasish Ray Chawdhuri
pages 页数: 340 pages
Publisher Finelybook 出版社: Packt Publishing (28 April 2017)
Language 语言: English
ISBN-10 书号: 1785889346
ISBN-13 书号: 9781785889349
B01KM5RLGS
Key Features
This book provides complete coverage of reactive and functional data structures
Based on the latest version of Java 9,this book illustrates the impact of new features on data structures
Gain exposure to important concepts such as Big-O Notation and Dynamic Programming
Book Description
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 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 learn
Understand the fundamentals of algorithms,data structures,and measurement of complexity
Find out what general purpose data structures are,including arrays,linked lists,double ended linked lists,and circular lists
Get a grasp on the basics of abstract data types—stack,queue,and double ended queue
See how to use recursive functions and immutability while understanding and in terms of recursion
Handle reactive programming and its related data structures
Use binary search,sorting,and efficient sorting—quicksort and merge sort
Work with the important concept of trees and list all nodes of the tree,traversal of tree,search trees,and balanced search trees
Apply advanced general purpose data structures,priority queue-based sorting,and random access immutable linked lists
Gain a better understanding of the concept of graphs,directed and undirected graphs,undirected trees,and much more
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.
Contents
Chapter 1. Why Bother? – Basic
Chapter 2. Cogs And Pulleys – Building Blocks
Chapter 3. Protocols – Abstract Data Types
Chapter 4. Detour – Functional Programming
Chapter 5. Efficient Searching – Binary Search And Sorting
Chapter 6. Efficient Sorting – Quicksort And Mergesort
Chapter 7. Concepts Of Tree
Chapter 8. More About Search – Search Trees And Hash Tables
Chapter 9. Advanced General Purpose Data Structures
Chapter 10. Concepts Of Graph
Chapter 11. Reactive Programming
主要特征
本书全面介绍了反应性和功能性数据结构
基于最新版本的Java 9，本书介绍了新功能对数据结构的影响
获得重要概念，如Big-O符号和动态规划
图书说明
Java 9数据结构和算法涵盖古典，功能和反应数据结构，使您能够了解计算复杂性，解决问题和编写高效的代码。本书是基于Java 9的Zero Bug Bounce里程碑。
我们从算法和数据结构的基础开始，帮助您了解基础知识和测量复杂性。从这里，我们向您介绍诸如数组，链接列表以及抽象数据类型（如堆栈和队列）的概念。接下来，我们将介绍功能编程的基础知识，同时确保您习惯于递归思考。
我们提供了大量的例子来帮助您了解每个概念。您将获得有关反应式编程，二进制搜索，排序，搜索树，无向图和更多的清晰图片！
你会学到什么
了解算法的基本原理，数据结构和复杂度测量
了解什么是通用数据结构，包括数组，链表，双端链表和循环列表
了解抽象数据类型的基础知识 - 堆栈，队列和双端队列
在理解和递归的过程中，了解如何使用递归函数和不变性
处理无效编程及其相关数据结构
使用二进制搜索，排序和高效排序 - 快速排序和合并排序
使用树的重要概念，列出树的所有节点，遍历树，搜索树和平衡搜索树
应用高级通用数据结构，优先级队列排序和随机访问不可变链表
更好地了解图形，有向图和无向图，无向树等概念
关于作者
Debasish Ray Chawdhuri是一名成熟的Java开发人员，在过去8年中一直在业界。他已经开发了几个系统，从CRUD应用程序到编程语言和大数据处理系统。他在塔塔咨询服务有限公司受雇时，提供了第一个可扩展业务报告语言规范实施及其周边产品，用于验证印度政府的公司财务数据。Talentica Software Pvt。他实现了一种特定领域的编程语言，可以轻松实现将编译为Java字节码的复杂数据聚合计算。目前，他正在领导一个开发新的高性能结构化数据存储框架，由Spark处理。该框架命名为Hungry Hippos，并将很快开放。他还在http://www.geekyarticles.com/上关于Java和其他与计算机科学相关的主题。
他曾在Tata Consultancy Services Ltd.，Oracle India Pvt。 Ltd.和Talentica Software Pvt。有限公司
目录
为什么别人？ - 基本
第2章齿轮和皮带轮 - 构件
第3章协议 - 抽象数据类型
第四章绕行 - 功能编程
第5章高效搜索 - 二进制搜索和排序
第6章高效排序 - Quicksort和Mergesort
第七章树的概念
第8章搜索更多 - 搜索树和哈希表
高级通用数据结构
第十章图的概念
第11章反应式编程
