I would like to share this with you: https://youtu.be/U0YW7x9U5TQ
Let me take a stab at it:
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).
Stuxnet would like a chat with you
Sounds like you should find a new product to use.
And would you call SSH a library?
Makes me realize I haven’t seen a dickbutt in years.
Just like Tolkien wrote it.
But if you want to know your saving, you will need to dust off the old formula. And if you do, you find the maximum saving to be around 41% (in the case of isosceles right triangle where the hypotenuse is a factor of sqrt 2 shorter).
Always has been
Or import this
Let me guess, instead of asking out another girl on 11/11/11 he played Skyrim?
My cup is only a deciliter in size. Now there’s tea all over the place!
Could have a pony tail for all we know.
OP died of spiciness before he could tell the tale.
It’s is probably more of sending a message.
T