7 - Algorithms, programming, and data representation 2024/2025 week 7/ClipID:55610 previous clip next clip

Keywords: programming pyhon
Recording date 2024-11-26

Language

English

Organisational Unit

Friedrich-Alexander-Universität Erlangen-Nürnberg

Producer

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

More clips in this category "Friedrich-Alexander-Universität Erlangen-Nürnberg"

2025-07-07
IdM-login / Studon
protected  
2025-07-04
IdM-login
protected