What Is Algorithm Complexity? #shorts

preview_player

Показать описание

Milan Jovanović

Рекомендации по теме

Комментарии

"How fast an given algorithm can be executed" doesn't seem right, an O(1) can certainly be slower than O(n) because we drop the leading constants which might change the order.
It's a measure on how execution time *changes* given an variable input.

funkydiddykong

I know Big O, and this is NOT a good clear explanation for anyone other than those already familiar with Big O notation.

ekcodes

Hey this is really helpful! What theme and editor are you using!! Thanks!

aidan-