Rainb0wSkeppy@lemmy.world to AnarchyChess@sopuli.xyzEnglish · 1 month agoif this post gets 32 upvotes, i will post again with twice as wide en passantlemmy.worldimagemessage-square32fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1imageif this post gets 32 upvotes, i will post again with twice as wide en passantlemmy.worldRainb0wSkeppy@lemmy.world to AnarchyChess@sopuli.xyzEnglish · 1 month agomessage-square32fedilink
minus-squareKogasa@programming.devlinkfedilinkarrow-up0·1 month agoO notation has a precise definition. A function f : N -> R+ is said to be O(g(x)) (for some g : N -> R) if there exists a constant c so that f(n) <= cg(n) for all sufficiently large n. If f is bounded, then f is O(1).
O notation has a precise definition. A function f : N -> R+ is said to be O(g(x)) (for some g : N -> R) if there exists a constant c so that f(n) <= cg(n) for all sufficiently large n. If f is bounded, then f is O(1).