Browse Library
Sign In Start Free Trial
Close icon Search icon
Account
Browse Library Advanced Search 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 Beginning Java Data Structures and Algorithms
  • Table Of Contents Toc
  • Feedback & Rating feedback
Beginning Java Data Structures and Algorithms

Beginning Java Data Structures and Algorithms

By : James Cutajar
4.6 (10)
Buy this Book
close
close
Beginning Java Data Structures and Algorithms

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.
Table of Contents (8 chapters)
close
close
close
Preface
Icon
Preface
Icon
Who This Book Is For
Icon
What This Book Covers
Icon
To Get the Most out of This Book
Icon
Get in Touch
Lock Free Chapter
1
Algorithms and Complexities
Icon
Algorithms and Complexities
Icon
Developing Our First Algorithm
Icon
Measuring Algorithmic Complexity with Big O Notation
Icon
Identifying Algorithms with Different Complexities
Icon
Summary
2
Sorting Algorithms and Fundamental Data Structures
Icon
Sorting Algorithms and Fundamental Data Structures
Icon
Introducing Bubble Sorting
Icon
Understanding Quick Sort
Icon
Using Merge Sort
Icon
Getting Started with Fundamental Data Structures
Icon
Summary
3
Hash Tables and Binary Search Trees
Icon
Hash Tables and Binary Search Trees
Icon
Introducing Hash Tables
Icon
Getting Started with Binary Search Trees
Icon
Summary
4
Algorithm Design Paradigms
Icon
Algorithm Design Paradigms
Icon
Introducing Greedy Algorithms
Icon
Getting Started with Divide and Conquer Algorithms
Icon
Understanding Dynamic Programming
Icon
Summary
5
String Matching Algorithms
Icon
String Matching Algorithms
Icon
Naive Search Algorithm
Icon
Getting Started with the Boyer-Moore String Searching Algorithm
Icon
Introducing Other String Matching Algorithms
Icon
Summary
6
Graphs, Prime Numbers, and Complexity Classes
chevron up
Icon
Graphs, Prime Numbers, and Complexity Classes
Icon
Representing Graphs
Icon
Traversing a Graph
Icon
Calculating Shortest Paths
Icon
Prime Numbers in Algorithms
Icon
Other Concepts in Graphs
Icon
Understanding Complexity Classes of Problems
Icon
Summary
7
Other Books You May Enjoy
Icon
Other Books You May Enjoy
Icon
Leave a Review - Let Other Readers Know What You Think

Prime Numbers in Algorithms

A prime number is a natural number greater than one whose only divisors are one and the number itself.

Prime numbers play a very important role in the fundamental theorem of arithmetic: every natural number greater than one is either a prime or a product of primes. Nowadays, number-theoretic algorithms are widely used, mainly due to cryptographic schemes based on large prime numbers. Most of those cryptographic schemes are based on the fact that we can efficiently find large primes, but we cannot factor the product of those large primes efficiently. As seen before, prime numbers play an important role in the implementation of hash tables.

Sieve of Eratosthenes

The sieve of Eratosthenes is a simple and ancient algorithm to find all prime numbers up to a given limit. If we want to find all prime numbers up to N, we start by creating a list of consecutive integers from 2 to N (2, 3, 4, 5… N), initially unmarked. Let's use p to denote the smallest unmarked number. Then...

Visually different images
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.
Beginning Java Data Structures and Algorithms
End of Section 6
Next Section
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist 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