85
string.lower implementation
(programming.dev)
Welcome to Programming Horror!
This is a place to share strange or terrible code you come across.
For more general memes about programming there's also Programmer Humor.
Looking for mods. If youre interested in moderating the community feel free to dm @Ategon@programming.dev
This looks like
O(n)
, because you don't include constants when calculating Big-O. It's still ~26 times slower than the implementation without the inner loop.~~This looks like
O(n^2)
because of thesub
.~~I was right the first time.
sub
is "substring" and not "substitute".