Tag Archives: fun
10 types of people
“There are 10 types of people: Those who see, those who see when shown and those who do not see”
No, Da Vinci did not quite phrase it like that.
Forvirret omkring statistik
Selvom jeg aldrig har været spejder selv, kan jeg godt lide spejderbevægelsen. Jeg har bidraget aktivt med min hjælp til loppemarkeder og andre aktiviteter, siddet i grupperåd da mine egne børn var spejdere og jeg vil generelt gerne hjælpe.
Derfor købte jeg også fluks nogle lodsedler, da min kammerats søn kom og spurgte, om jeg ville støtte spejderne ved at deltage i deres lotteri.
Det er nogle år siden at jeg sidst gik i skole, men jeg mener at kunne huske, at med 3 lodsedler er sandsynligheden for at vinde, større end hvis jeg kun havde en. Men hvor meget større?
Er der nogen der vil hjælpe her? Hvor meget større er sandsynligheden for at vinde, når nu jeg har 3 lodsedler – med samme nummer?
Ja, jeg spørger – for jeg er lidt forvirret
Bonding
Image

iPhone 5
Bjarne Riis Emotion Chart
Singing your source
…and while I’m at it. The following piece of code, which Sam Aron presented at the goto; conference (I don’t know where he got it from) is also the lyrics of a christmas song.
better watchout better !cry !pout lpr why santa claus <north pole > town cat /etc/passwd > list ncheck list ncheck list cat list | grep naughty > nogiftlist cat list | grep nice > giftlist santa claus <north pole > town who | grep sleeping who | grep awake who | egrep ‘bad|good’ for (goodness sake) {be good}
Friday puzzle
My good friend Frank just sent me this email (I did translate to English though). I had never seen the algorithm before, so it gave me a good laugh. Now I need to share it. It’s written in Groovy:
If you just need to get some blood through the neural cells after the pork roast, try to figure out the code below.
Hint: a classic sort algorithm, but which one?
—————————————–
import java.util.concurrent.*
def list = new CopyOnWriteArrayList()
def task = { n ->
t = {
sleep(n);
list.add(n)
} // job in a closure
t as Callable // return block as a callable }
def workers = []
[5, 3, 7, 2, 1, 1, 3, 4].each { n ->
workers.add(task(n))
}
def executor = Executors.newFixedThreadPool(workers.size());
def futures = executor.invokeAll(workers, 10, TimeUnit.SECONDS);
println list # the sorted list
So, what is it? Eh’? Eh’? :o)