Book Overview & Buying
Table Of Contents

Beginning Java Data Structures and Algorithms

By : James Cutajar

4.6 (10)

Buy this Book

Beginning Java Data Structures and Algorithms

4.6 (10)

By: James Cutajar

Buy this Book

Overview of this book

Learning about data structures and algorithms gives you a better insight on how to solve common programming problems. Most of the problems faced everyday by programmers have been solved, tried, and tested. By knowing how these solutions work, you can ensure that you choose the right tool when you face these problems. This book teaches you tools that you can use to build efficient applications. It starts with an introduction to algorithms and big O notation, later explains bubble, merge, quicksort, and other popular programming patterns. You’ll also learn about data structures such as binary trees, hash tables, and graphs. The book progresses to advanced concepts, such as algorithm design paradigms and graph theory. By the end of the book, you will know how to correctly implement common algorithms and data structures within your applications.

Preface

Who This Book Is For

What This Book Covers

To Get the Most out of This Book

Get in Touch

Free Chapter

Algorithms and Complexities

Developing Our First Algorithm

Measuring Algorithmic Complexity with Big O Notation

Identifying Algorithms with Different Complexities

Summary

Sorting Algorithms and Fundamental Data Structures

Introducing Bubble Sorting

Understanding Quick Sort

Using Merge Sort

Getting Started with Fundamental Data Structures

Summary

Hash Tables and Binary Search Trees

Introducing Hash Tables

Getting Started with Binary Search Trees

Summary

Algorithm Design Paradigms

Introducing Greedy Algorithms

Getting Started with Divide and Conquer Algorithms

Understanding Dynamic Programming

Summary

String Matching Algorithms

Naive Search Algorithm

Getting Started with the Boyer-Moore String Searching Algorithm

Introducing Other String Matching Algorithms

Summary

Graphs, Prime Numbers, and Complexity Classes

Representing Graphs

Traversing a Graph

Calculating Shortest Paths

Prime Numbers in Algorithms

Other Concepts in Graphs

Understanding Complexity Classes of Problems

Summary

Other Books You May Enjoy

Leave a Review - Let Other Readers Know What You Think

Other Books You May Enjoy

If you enjoyed this book, you may be interested in these other products by Packt:

Everyday Data Structures
William Smith

ISBN: 978-1-78712-104-1

A rapid overview of data types, applications for each type, best practices and high-level variations between platforms
Review the most common data structures and build working examples in the languages used for mobile platform software development
Understand advanced data structure concepts such as generic collections, searching and sorting algorithms, and recursion
Learn to use Stacks (LIFO) and queues (FIFO) in your daily application
Add/remove objects and nest arrays and dictionaries within another dictionary and understand why such architecture is often preferred or necessary
Get acquainted with the tree structures such as heap, binary, and graphs, apply them to work
Unleash the power of different sorting...