Back to courses

Algorithms and Data Structures

Intermediate Algorithms English

Also available: Deutsch

by Best

Algorithms and data structures in Java: abstract types, lists, trees, graphs, hashing, sorting, and related patterns.

University approvals: 0

Abstract Data Type and Information Hiding Card
Stack: LIFO and Typical Errors Card
Queue: FIFO and Capacity Card
ArrayStack in Java Card
Euclidean Algorithm and Runtime Card
When Stack, When Queue? Card

Singly Linked List and Nodes Card
Insertion and Deletion at Positions Card
Iterator over Lists Card
Doubly Linked List Card
ArrayList vs LinkedList Card
Sorted List and compareTo Card

Recursion: Base Case and Decomposition Card
Call Stack and StackOverflowError Card
Linear Recursion: Factorial and Sum Card
Branching Recursion and Multiple Work Card
Recursion on Linked Structures Card
Tail Recursion and Iteration in Java Card

Graphs: Adjacency List Card
BFS and Queue Card
DFS and Recursion Card
Weighted Edges and Dijkstra's Idea Card
Directed vs Undirected Graphs Card
Short implementation: Count neighbors Card

Backtracking: Attempt and Reversion Card
State Space and Cuts Card
n-Queens Idea Card
Mutable State and Undo Card
Recursion with Decision Card
Small Implementation: Subset Sum Card

Selection Sort Card
Insertion Sort Card
Stability Card
Comparisons and Swaps Card
When simple sorters Card
Implementation: Selection Sort Step Card

Merge Sort Card
Quicksort Idea Card
Partition Card
Lower Bound Comparison Sorting Card
Arrays.sort in Java Card
Implementation: Hoare/Lomuto-light Partition Card