All Packages
Package Summary
Package
Description
Backtracking algorithms — systematic exploration of solution spaces with pruning.
Execution-time benchmarks for backtracking algorithms.
Branch-and-Bound algorithms — intelligent search for combinatorial optimisation.
Execution-time benchmarks for branch-and-bound algorithms.
Utility classes shared by branch-and-bound implementations.
Multi-threaded branch-and-bound utilities.
Divide-and-Conquer algorithms — break, solve, and combine.
Utility classes shared by divide-and-conquer implementations.
Dynamic Programming algorithms — optimisation via overlapping sub-problems.
Greedy algorithms — globally optimal solutions through locally optimal choices.
Execution-time benchmarks for greedy agents-to-tasks assignment.
Introduction to algorithms, computational thinking, and fundamental data structures.
Worked examples illustrating core Java data-structure APIs.
Parallel algorithms using Java's Fork/Join Framework.
Sorting algorithms — from simple quadratic to optimal linearithmic.
Additional sorting algorithms beyond the core set.
Utility classes shared by sorting implementations.