Problem: Given two list of length n, find what elements the two list have in common.
(we assume that there are not duplicates within a single list)
Naive solution: For each element in the first list, check if it appears in the second.
Bogo solution: For each permutation of the first list and for each permutation of the second list, check if the first item in each list is the same. If so, report in the output (and make sure to only report it once).
Not everything can be done in constant time, that's O(k) ( sh.itjust.works )
Google ad on a magazine from 1999 ( i.redd.it )
cross-posted from: https://lemmy.ca/post/22055566...
Absolute legend ( lemmy.today )