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!
Java 9 Data Structures and Algorithms
Credits
www.PacktPub.com
Customer Feedback
Preface
Free Chapter
Why Bother? – Basic
Cogs and Pulleys – Building Blocks
Protocols – Abstract Data Types
Detour – Functional Programming
Efficient Searching – Binary Search and Sorting
Efficient Sorting – quicksort and mergesort
Concepts of Tree
More About Search – Search Trees and Hash Tables
Concepts of Graph
Reactive Programming
Index

Search algorithms

Suppose you are given an array of values and you are required to check whether a particular value is in that array, what is the most natural way to find that element? Well, it seems that the natural way is to go through each element one by one and check whether they match the given value. If any one does, we have found that element and we can return the index; if not, we can return -1 at the end of processing all the elements to report that such an element could not be found. This is what we would call a linear search. The following demonstrates a linear search algorithm in an array:

public static <E, F extends E> int linearSearch(E[] values,
valueToLookup) {
for (int i = 0; i < values.length; i++) {
if (values[i].equals(valueToLookup)) {
return i;
}
}
return -1;
}

The function linearSearch takes an array of values and a value to search in it, and returns the index if the value is...