Book Image

Beginning Java Data Structures and Algorithms

By : Kristian Secor
Book Image

Beginning Java Data Structures and Algorithms

By: Kristian Secor

Overview of this book

Learning about data structures and algorithms gives you better insight on how to solve common programming problems. Most of the problems faced every day 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 course 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 course progresses to advanced concepts, such as algorithm design paradigms and graph theory. By the end of the course, you will know how to correctly implement common algorithms and data structures within your applications.

Related Content you might be interested in

Current Title:

Small book image
Beginning Java Data Structures and Algorithms
Kristian Secor
Jan, 2019 | 2 hours 56 minutes
No titles found
Table of Contents (6 chapters)
Free Chapter
1
Algorithms and Complexities
Course Overview
Lesson Overview
Developing Our First Algorithm
Measuring Algorithmic Complexity with Big O Notation
Identifying Algorithms with Different Complexities
Summary
2
Sorting Algorithms and Fundamental Data Structures
Lesson Overview
Introducing Bubble Sorting
Understanding Quick Sort
Using Merge Sort
Getting Started with Fundamental Data Structures
Summary
3
Hash Tables and Binary Search Trees
Lesson Overview
Introducing Hash Tables Part 1
Introducing Hash Tables Part 2
Getting Started with Binary Search Trees
Traversing a Binary Search Tree
Summary
4
Algorithm Design Paradigms
Lesson Overview
Introducing Greedy Algorithms
Getting Started with Divide and Conquer Algorithms
Understanding Dynamic Programming
Summary
5
String Matching Algorithms
Lesson Overview
Naive Search Algorithms
Getting Started with the Boyer-Moore String Searching Algorithm
Introducing Other String Matching Algorithms
Summary
6
Graphs, Prime Numbers, and Complexity Classes
Lesson Overview
Representing Graphs
Traversing a Graph
Calculating Shortest Paths
Prime Numbers in Algorithms
Other Concepts in Graphs
Summary
Chapter 3
Hash Tables and Binary Search Trees
Content Locked
Section 4
Getting Started with Binary Search Trees
Like hash tables, binary search trees are fast lookup data structures for organizing key value pairs and implement the data dictionary operations. In addition to providing insert, search, and delete, binary tree supports efficient querying such as finding minimum and maximum, successor, and predecessor. When using balanced binary search trees, insert and search operations have a worst-case runtime complexity of O(log n). This is a big theoretical improvement over the worst-case scenario of a hash table, which is O(n).
Previous Section
End of Section 4
Next Section