250x250
Notice
Recent Posts
Recent Comments
Link
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | |
7 | 8 | 9 | 10 | 11 | 12 | 13 |
14 | 15 | 16 | 17 | 18 | 19 | 20 |
21 | 22 | 23 | 24 | 25 | 26 | 27 |
28 | 29 | 30 | 31 |
Tags
- CLASS
- web
- 삶
- express.js
- REACT
- concept
- tailwindcss
- Interface
- JavaScript
- API
- 기준
- middleware
- CSS
- built in object
- solidity
- Redux
- SSR
- typeScript
- blockchain
- node.js
- evm
- hardhat
- nextJS
- useState
- error
- Ethereum
- Props
- graphQL
- bitcoin
- HTML
Archives
- Today
- Total
목록big-O notation (1)
ReasonJun
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/cu0ifE/btstSiFbNyY/wm8535L0ZufYJyJJiKPpF1/img.png)
Time complexity Time complexity is a measure of the performance of an algorithm. Analysis of algorithm execution time for input of a specific size. If there are algorithms that perform the same function, the lower the complexity, the better. Big-O Notation This is a notation that considers only the fastest growing terms. Indicates the upper limit of the funciton. For example, let's say there is ..
Frontend/Javascript Coding Test
2023. 9. 14. 11:36