this post was submitted on 22 Jul 2024
83 points (97.7% liked)
Programming Horror
239 readers
1 users here now
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 @[email protected]
Rules
- Keep content in english
- No advertisements (this includes both code in advertisements and advertisement in posts)
- No generated code (a person has to have made it)
Credits
founded 1 year ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
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".