https://github.com/felipeaz/big-o-notation
Big O describes the function growth when the input scales, measuring the algorithm complexity.
https://github.com/felipeaz/big-o-notation
algorithm-complexity bigonotation golang
Last synced: 3 months ago
JSON representation
Big O describes the function growth when the input scales, measuring the algorithm complexity.
- Host: GitHub
- URL: https://github.com/felipeaz/big-o-notation
- Owner: felipeaz
- Created: 2023-01-01T13:05:35.000Z (over 2 years ago)
- Default Branch: master
- Last Pushed: 2023-01-01T22:22:19.000Z (over 2 years ago)
- Last Synced: 2025-01-07T05:22:05.295Z (4 months ago)
- Topics: algorithm-complexity, bigonotation, golang
- Language: Go
- Homepage:
- Size: 5.86 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# big-o-notation
Big O describes the function growth when the input scales, measuring the algorithm complexity.
# Why is it important to measure performance?
Code is not just "making it work" and it's fine, we follow that rule when we started working with code but unfortunately,
that's not how it works in the real world. In big companies that's a subject really important because we know our services
will receive a huge amount of requests and we must be prepared for that. Our code must work and more than that, it must
work in any scenario, it should be created in the best way possible.
There are many solutions to improve performance a code such as caching data, scaling an application using green threads
(go routines) or threads and so on. Each one of these solution is valid to consider when improving a code performance
but they might be isolated to a specific case, for example caching would make sense when the code is getting some data
from a database for example. The Big O notation will measure the logic complexity of an algorithm and how it grows when
the input size increases