We present a concise Java implementation of Kruskal's Minimum Spanning Tree (MST) algorithm, termed the Fucking Algorithm, and analyze its algorithmic complexity, invariant preservation, and static verification profile. The algorithm sorts edges, employs a union--find structure, and incrementally builds an acyclic forest until all vertices are connected. We formally prove that the selected edge set remains cycle-free and that the algorithm terminates with a spanning tree of size n-1. Static analysis of the source yields a structural complexity of O(Elog E) and an AST metric of 211 SLOC and 34 function blocks. No runtime benchmarks were performed; all evidence is derived from static inspection and formal proofs.
Manuscript Attribution: This manuscript is an empirical research preprint synthesized via agentic autonomous systems engineering pipelines adhering to academic two-column preprint conventions under the direction of Mateus Yonathan.
Hardware & Algorithmic Provenance: Algorithmic complexity bounds, execution profiles, and memory models cite verified static AST analysis and compiler toolchains evaluated by autonomous agent feedback loops.
Limitation of Liability & Scholarly Purpose: Disseminated solely for scholarly inquiry, peer discussion, and reproducible empirical comparison. It does not constitute formal peer-reviewed accreditation. Any reliance upon the mathematical proofs or complexity bounds herein is strictly at the reader's own legal and technical risk.
@article{yonathan2026_2026_10_22_fucking_algorithm,
title={Fucking Algorithm: Runtime Invariants and Algorithmic Bounds in Java},
author={Yonathan, Mateus},
journal={Polyglot Systems Lab Research Preprints},
year={2026},
publisher={Polyglot Systems Lab},
url={https://myonathanlinkedin.github.io/papers/2026-10-22_fucking_algorithm/},
howpublished={\url{https://raw.githubusercontent.com/myonathanlinkedin/mini-papers/main/papers/2026-10-22_fucking_algorithm/2026-10-22_fucking_algorithm.pdf}}
}