198
submitted 1 year ago* (last edited 1 year ago) by andioop@programming.dev to c/programming_horror@programming.dev
you are viewing a single comment's thread
view the rest of the comments
[-] odium@programming.dev 7 points 1 year ago

Have you tried seeing if the recursive approach runs faster?

[-] noddy@beehaw.org 13 points 1 year ago

I know an even better way. We can make it run in O(1) by using a lookup table. We only need to store 2^64 booleans in an array first.

this post was submitted on 07 Dec 2023
198 points (100.0% liked)

Programming Horror

1891 readers
2 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 @Ategon@programming.dev

Rules

Credits

founded 2 years ago
MODERATORS