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

Since the data structures that we have studied so far store their data in one or two arrays and avoid resizing these arrays too often, the arrays frequently are not very full. For example, immediately after a `resize()` operation on an `ArrayStack`, the backing array is only half full. Even worse, there are times when only one-third of it contains data.

## Visual demonstration
A sequence of `add(i, x)` and `remove(i)` operations on a `RootishArrayStack` is illustrated below. Arrows denote elements being copied.

Since the data structures that we have studied so far store their data in one or two arrays and avoid resizing these arrays too often, the arrays frequently are not very full. For example, immediately after a `resize()` operation on an `ArrayStack`, the backing array is only half full. Even worse, there are times when only one-third of it contains data.

# Visual demonstration
A sequence of `add(i, x)` and `remove(i)` operations on a `RootishArrayStack` is illustrated below. Arrows denote elements being copied.

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

RootishArrayStack: A Space-Efficient Array Stack

Visual demonstration