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
Hi, I’m Ashley
@leadgen
Awww! Most stable sorting algorithms are O(n log n) I.E Python and Java sort. The log n part is the height of each insertion/comparison level, but you do n of them.
0 reply
0 recast
1 reaction
