관리 메뉴

Silver Library (Archived)

Simple explanation - Runtime complexity 본문

Personal DB

Simple explanation - Runtime complexity

Chesed Kim 2022. 3. 28. 23:23
반응형

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 and solution, but what is the run time…

medium.com

"We can say that the amount of work had to do N squared O(n²) = (2², 3², 4²) or quadratic runtime."

 

Linear time = O(n)

Constatn time = O(1)

Quadratic time = O(n²)

The O, in this case, stand for Big ‘O’, because is literally a big O.

'Personal DB' 카테고리의 다른 글

[Radical Treatment] git push error  (0) 2022.04.17
How I define - for loop  (0) 2022.04.05
Software engineer? Or developer?  (0) 2022.03.24
[용어] FAANG-type companies  (0) 2022.01.03
Update Powershell via command line  (0) 2022.01.02