193

submitted 7 months ago* (last edited 7 months ago) by andioop@programming.dev to c/programming_horror@programming.dev

56 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[-] odium@programming.dev 7 points 7 months ago

Have you tried seeing if the recursive approach runs faster?

[-] noddy@beehaw.org 13 points 7 months 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

193 points (91.1% liked)

Programming Horror

1634 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 @Ategon@programming.dev

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)

founded 1 year ago

MODERATORS