Browse Library
Sign In Start Free Trial
Close icon Search icon
Account
Browse Library Sign In Start Free Trial

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Java 9 Data Structures and Algorithms
  • Table Of Contents Toc
Java 9 Data Structures and Algorithms

Java 9 Data Structures and Algorithms

By : Debasish Ray Chawdhuri
2.3 (3)
Buy this Book
close
close
Java 9 Data Structures and Algorithms

Java 9 Data Structures and Algorithms

2.3 (3)
By: Debasish Ray Chawdhuri
Buy this Book

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!
Table of Contents (13 chapters)
close
close
close
Preface
Icon
Preface
Icon
What this book covers
Icon
What you need for this book
Icon
Who this book is for
Icon
Conventions
Icon
Reader feedback
Icon
Customer support
Lock Free Chapter
1
1. Why Bother? – Basic
Icon
1. Why Bother? – Basic
Icon
The performance of an algorithm
Icon
Optimization of our algorithm
Icon
Fixing the problem with large powers
Icon
Summary
2
2. Cogs and Pulleys – Building Blocks
Icon
2. Cogs and Pulleys – Building Blocks
Icon
Arrays
Icon
Linked list
Icon
Doubly linked list
Icon
Circular linked list
Icon
Summary
3
3. Protocols – Abstract Data Types
Icon
3. Protocols – Abstract Data Types
Icon
Stack
Icon
Queue
Icon
Double ended queue
Icon
Summary
4
4. Detour – Functional Programming
Icon
4. Detour – Functional Programming
Icon
Recursive algorithms
Icon
Lambda expressions in Java
Icon
Functional data structures and monads
Icon
The concept of a monad
Icon
Analysis of the complexity of a recursive algorithm
Icon
Performance of functional programming
Icon
Summary
5
5. Efficient Searching – Binary Search and Sorting
Icon
5. Efficient Searching – Binary Search and Sorting
Icon
Search algorithms
Icon
Sorting
Icon
A problem with recursive calls
Icon
Summary
6
6. Efficient Sorting – quicksort and mergesort
Icon
6. Efficient Sorting – quicksort and mergesort
Icon
quicksort
Icon
mergesort
Icon
Complexity of any comparison-based sorting
Icon
The stability of a sorting algorithm
Icon
Summary
7
7. Concepts of Tree
chevron up
Icon
7. Concepts of Tree
Icon
A tree data structure
Icon
The tree abstract data type
Icon
Binary tree
Icon
Summary
8
8. More About Search – Search Trees and Hash Tables
Icon
8. More About Search – Search Trees and Hash Tables
Icon
Binary search tree
Icon
Self-balancing binary search tree
Icon
Red-black tree
Icon
Hash tables
Icon
Summary
9
9. Advanced General Purpose Data Structures
Icon
9. Advanced General Purpose Data Structures
Icon
Priority queue ADT
Icon
Heap
Icon
Linked heap
Icon
Binomial forest
Icon
Sorting using a priority queue
Icon
In-place heap sort
Icon
Summary
10
10. Concepts of Graph
Icon
10. Concepts of Graph
Icon
What is a graph?
Icon
The graph ADT
Icon
Representation of a graph in memory
Icon
Traversal of a graph
Icon
Cycle detection
Icon
Spanning tree and minimum spanning tree
Icon
Finding the minimum spanning tree
Icon
Summary
11
11. Reactive Programming
Icon
11. Reactive Programming
Icon
What is reactive programming?
Icon
Producer-consumer model
Icon
Functional way of reactive programming
Icon
Summary
12
Index
Icon
Index

The tree abstract data type

Now that we have some idea of the tree, we can define the tree ADT. A tree ADT can be defined in multiple ways. We will check out two. In an imperative setting, that is, when trees are mutable, we can define a tree ADT as having the following operations:

  • Get the root node

  • Given a node, get its children

This is all that is required to have a model for a tree. We may also include some appropriate mutation methods.

The recursive definition for the tree ADT can be as follows:

  • A tree is an ordered pair containing the following:

    • a value

    • a list of other trees, which are meant to be it's subtrees

We can develop a tree implementation in exactly the same way as it is defined in the functional tree ADT:

public class FunctionalTree<E> {
    private E value;
    private LinkedList<FunctionalTree<E>> children;

As defined in the ADT, the tree is an ordered pair of a value and a list of other trees, as follows:

    public FunctionalTree(E value, LinkedList<FunctionalTree...
CONTINUE READING
83
Tech Concepts
36
Programming languages
73
Tech Tools
Icon Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.
Icon Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.
Icon 50+ new titles added per month and exclusive early access to books as they are being written.
Java 9 Data Structures and Algorithms
End of Section 7
Next Section
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist download Download options
font-size Font size

Change the font size

margin-width Margin width

Change margin width

day-mode Day/Sepia/Night Modes

Change background colour

Close icon Search
Country selected
Close icon Your notes and bookmarks

Confirmation

Modal Close icon
claim successful
Order Page Read Now

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY

Submit Your Feedback

Modal Close icon
Modal Close icon
Modal Close icon