Content
@
https://opensea.io/collection/dev-21
0 reply
0 recast
2 reactions
Nicki Sanders
@nicki
Confession: I don’t know what O(n log n) means and I don’t want to.
4 replies
0 recast
5 reactions
Moon
@moon.eth
the math notation makes it more confusing than it really is but a lot of people struggle with internalizing it. it's just an indicator of, how well your function can handle a lot of data. there are functions that are O(n3) that work fine for a small amount of data but if you put it into production with real users, it falls over instantly.
1 reply
0 recast
2 reactions
Nicki Sanders
@nicki
I know that part. I don’t know how to tell if an algorithm has that complexity.
1 reply
0 recast
1 reaction
dionysuz
@dionysuz.eth
the best way is to think about it is in terms of trees in my opinion! for example a binary search is log_2(n) complexity, because you divide the search space in half recursively until you find the item. so an nlog(n) algorithm is something that does that recursive tree splitting behavior, but does it n times. for example inserting into a balanced binary tree. the position search takes log(n) and you insert n items, and its n * log(n)
0 reply
0 recast
1 reaction
