O-notation, algorithm complexity - Kotlin Programming Basics
The upper estimate of the complexity of algorithms is the notation of big O(N). Why can the same operations have different complexity.
Support the channel by becoming a sponsor: https://uandcode.com/join
Content for sponsors: https://uandcode.com/paid-content/
Telegram channel: https://uandcode.com/telegram
Telegram chat: https://uandcode.com/telegram/chat
LinkedIn: https://uandcode.com/linkedin
GitHub: https://uandcode.com/github
Medium: https://uandcode.com/medium
Twitch: https://uandcode.com/twitch
Mentoring/consulting: https://uandcode.com/services/
00:00 - Complexity of algorithms
11:53 - Solution to the previous task