This course introduces data structures and algorithms, focusing on practical implementation in Java.

java.tar.gz

Java

Java-1

Data structures and algorithms are essential in computer science since they play a crucial role in efficient information retrieval and processing, dealing with files, storing contacts on phones, social networks and web searches.

In this course, you’ll learn about the array-based implementation of various linear data structures, stack, and queues. You’ll also learn about linked list-based implementation. Next, you’ll explore advanced data structures like skiplists and hashing. You’ll learn how to implement a variety of trees and graphs, and data structures related to bits of an integer. Toward the end of the course, you’ll learn the implementation of structures based on external storage.

After completing this course, you’ll be able to create reusable programs with template-based collections that can efficiently analyze how to optimize the storage and retrieval of very large amounts of data. Overall, this course will enhance your productivity and performance as a software developer.

Data Structures with Generic Types in Java

Next, we present a data structure, the `DualArrayDeque` that achieves the same performance bounds as an `ArrayDeque` by using two `ArrayStack`s. Although the asymptotic performance of the `DualArrayDeque` is no better than that of the `ArrayDeque`, it is still worth studying, since it offers a good example of how to make a sophisticated data structure by combining two simpler data structures.

## Two ends of a `DualArrayDeque`
A `DualArrayDeque` represents a list using two `ArrayStack`s. Recall that an `ArrayStack` is fast when the operations on it modify elements near the end. A `DualArrayDeque` places two `ArrayStack`s, called `front`
and `back`, back-to-back so that operations are fast at either end.

Next, we present a data structure, the `DualArrayDeque` that achieves the same performance bounds as an `ArrayDeque` by using two `ArrayStack`s. Although the asymptotic performance of the `DualArrayDeque` is no better than that of the `ArrayDeque`, it is still worth studying, since it offers a good example of how to make a sophisticated data structure by combining two simpler data structures.

# Two ends of a `DualArrayDeque`
A `DualArrayDeque` represents a list using two `ArrayStack`s. Recall that an `ArrayStack` is fast when the operations on it modify elements near the end. A `DualArrayDeque` places two `ArrayStack`s, called `front`
and `back`, back-to-back so that operations are fast at either end.

Learn how to implement the DualArrayDeque data structure.

Overview

Array-Based Lists

Linked Lists

Skiplists

Hash Tables

Binary Trees

Random Binary Search Trees

Scapegoat Trees

Red-Black Trees

Heaps

Sorting Algorithms

Graphs

Data Structures for Integers

External Memory Searching

Wrap Up

DualArrayDeque: Building a Deque from Two Stacks

Two ends of a `DualArrayDeque`