Notice
Recent Posts
Recent Comments
Link
목록2022/03/28 (1)
Silver Library (Archived)
Simple explanation - Runtime complexity
Dot point: - assume each n value can be determined based on the number of iterating its value. - imagine each row and column value increases, that length is the one to decide its n value. e.g. 1 row, 1 column = [n = 1], 2 row, 2 column = [n = 2]. What Is the Runtime Complexity or Big ‘O’ Notation? You probably heard a lot about runtime complexity and how this can help you to build better code an..
Personal DB
2022. 3. 28. 23:23