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
- solidity
- Redux
- JavaScript
- bitcoin
- tailwindcss
- CSS
- API
- Interface
- node.js
- evm
- 기준
- typeScript
- REACT
- hardhat
- built in object
- CLASS
- nextJS
- graphQL
- express.js
- HTML
- middleware
- SSR
- blockchain
- concept
- Props
- web
- useState
- 삶
- error
- Ethereum
Archives
- Today
- Total
ReasonJun
Coding test basic theory 본문
728x90
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 an alforithm where the number of operations is 3N^3 + 5N^2 + 1,000,000.
- As N increases, the influence of terms other than 3N^3 becomes smaller.
- In Big-0 notation, the coefficient is excluded from the term with the largest degree and is expressed as 0(N^3).
728x90
'Frontend > Javascript Coding Test' 카테고리의 다른 글
What is coding test? (0) | 2023.09.14 |
---|
Comments