Switch to the store?

Beginning Java Data Structures and Algorithms

More Information
Learn
  • Understand some of the fundamental concepts behind key algorithms
  • Express space and time complexities using Big O notation.
  • Correctly implement classic sorting algorithms such as merge and quicksort
  • Correctly implement basic and complex data structures
  • Learn about different algorithm design paradigms, such as greedy, divide and conquer, and dynamic programming
  • Apply powerful string matching techniques and optimize your application logic
  • Master graph representations and learn about different graph algorithms
About

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.

Features
  • Explains in detail different algorithms and data structures with sample problems and Java implementations where appropriate
  • Includes interesting tips and tricks that enable you to efficiently use algorithms and data structures
  • Covers over 20 topics using 15 practical activities and exercises
Page Count 202
Course Length 6 hours 3 minutes
ISBN 9781789537178
Date Of Publication 29 Jul 2018
Developing Our First Algorithm
Measuring Algorithmic Complexity with Big O Notation
Identifying Algorithms with Different Complexities
Summary
Introducing Hash Tables
Getting Started with Binary Search Trees
Summary
Introducing Greedy Algorithms
Getting Started with Divide and Conquer Algorithms
Understanding Dynamic Programming
Summary
Naive Search Algorithm
Getting Started with the Boyer-Moore String Searching Algorithm
Introducing Other String Matching Algorithms
Summary

Authors

James Cutajar

James Cutajar is a software developer with an interest in scalable, high-performance computing, and distributed algorithms. He is also an author, open source contributor, blogger, and a tech evangelist. When he is not writing software, he is riding his motorbike, surfing, or flying light aircraft. He was born in Malta, lived in London for almost a decade, and is now working in Portugal.