Defines a generic SortAlgorithm interface with a single sort(T[]) method, enabling polymorphic sorting across all sort implementations. This is a clean, reusable abstraction that allows any sorting algorithm to be swapped in without changing client code. The interface is implemented by dozens of sort classes (BubbleSort, QuickSort, TimSort, etc.), demonstrating consistent design.

An abstract generic class that maintains a running median of a stream of numbers. It provides a template method calculateAverage() that subclasses override for different numeric types (Integer, Long, Float, Double, Byte). This pattern is reusable for any streaming median problem and demonstrates clean separation of concerns.

Implements a Grow-Only Counter (G-Counter) conflict-free replicated data type (CRDT) for distributed systems. It supports increment, merge, and value retrieval with strong eventual consistency. The implementation is self-contained, uses generics, and demonstrates a non-trivial distributed computing pattern that can be extracted and reused in other projects.

A generic Disjoint Set Union (Union-Find) implementation with path compression and union by rank. It provides find, union, and count operations. The code is clean, well-documented, and follows standard best practices. This is a classic data structure that is reusable in many graph and connectivity problems.

Implements a segment tree with lazy propagation for range updates and range queries. It supports both point and range operations, and the lazy propagation ensures O(log n) performance for updates. The implementation is generic (works with any associative operation) and demonstrates advanced data structure engineering.