Algorithms, programming, and data representation 2024/2025
Prof. Dr. Bernhard Kainz
IdM-Anmeldung
Englisch
Friedrich-Alexander-Universität Erlangen-Nürnberg
algorithm complexity.
please note the nested loop on the blackboard is O(n^2) not O(nlogn) -- would need to for example have i/n range to make O(nlogn) possible