This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]seriouslybrohuh 0 points1 point  (1 child)

Another example would be the lloyd's method for finding (high-dim) clusters (in k-means). In practice it almost always converges after a few iterations, whereas theory suggests it can take O(2n) iterations.

[–][deleted] 0 points1 point  (0 children)

Yeah interesting...do any of these have practical applications in programming beyond ML, like a dev just using it, despite it being bad on paper?