this post was submitted on 22 Jun 2024
404 points (97.4% liked)

Programmer Humor

19722 readers
48 users here now

Welcome to Programmer Humor!

This is a place where you can post jokes, memes, humor, etc. related to programming!

For sharing awful code theres also Programming Horror.

Rules

founded 1 year ago
MODERATORS
anzo
Feyter
BurningTurtle
pylapp
404
Not everything can be done in constant time, that's O(k) (sh.itjust.works)
submitted 5 months ago by [email protected] to c/programmer_humor
41 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 1 points 5 months ago* (last edited 5 months ago)

actually all of my effort was wasted since calculating the hamming distance between two lists of n hashes has a complexity of O(n) not O(1) agh

I realized this right after walking away from my devices from this to eat something :(

edit : you can calculate the hamming distance one element at a time just after rehashing that element so nevermind