How aqtanbi/daa_assignment_2 works
This is a Java algorithms assignment implementing three standalone integer data structures: a resizable array, a singly linked list, and an array-backed min-heap. Their public operations let a caller add, access, remove, or inspect values; the heap also supports minimum extraction. Each implementation manages its own representation and invariants, with no shared runtime orchestrator or external service. The README documents the capabilities; the supplied excerpts show their implementations. Benchmark and test code are not part of the runtime architecture.
Components 4
Dynamic Array
- Resizable Storage
src/main/java/DynamicArray.java
Linked List
- Singly Linked Nodes
src/main/java/LinkedList.java
Min Heap
- Priority Operations
src/main/java/MinHeap.java
Other components
- Library Caller