/prog/ - Genius sorting algorithm: Sleep sort

Name: Anonymous 2011-01-20 12:22

Man, am I a genius. Check out this sorting algorithm I just invented.





#!/bin/bash

function f() {

    sleep "$1"

    echo "$1"

}

while [ -n "$1" ]

do

    f "$1" &

    shift

done

wait

example usage:
./sleepsort.bash 5 3 6 3 6 3 1 4 7

Name: Anonymous 2011-01-20 12:27

>>1
Oh god, it works.

But I don't like to wait 218382 seconds to sort '(0 218382)

Name: Anonymous 2011-01-20 12:31

>>2
yes the worst case is very big

Name: Anonymous 2011-01-20 12:45

What's the complexity?

Name: Anonymous 2011-01-20 12:56

#!/bin/bash

function f() {

    sleep $(echo "$1 / 10" |bc -l)

    echo "$1"

}

while [ -n "$1" ]

do

    f "$1" &

    shift

done

wait

OMG OPTIMISED
_{_{Make sure you have an implementation of sleep that accepts floating-point arguments.}}

Name: Anonymous 2011-01-20 13:10

>>4
Well i'm not sure how you define it. Basically O(highest_value_in_input)

Name: Anonymous 2011-01-20 14:16

O(highest_value_in_input + n) there is a linear time for creating each thread (it is a thread right?)

congrats OP, it is awesome

Name: Anonymous 2011-01-20 14:31

okay, so basically it sleeps longer depending on the number so the smaller numbers wake up sooner?

Name: Anonymous 2011-01-20 14:35

dicksort() {

    while [ -n "$1" ]

    do

       (sleep "$1"; echo "$1") &

       shift

    done

    wait

}



dicksort 2 1 4 3 2 1 99999999

Name: Anonymous 2011-01-20 14:41

Standard value based sort if you ask me.

Name: Anonymous 2011-01-20 15:25

f() {

    if test -n "$1"

        then ( sleep $1; echo $1 ) &

        shift

        f $*

        wait

    fi

}

Name: Anonymous 2011-01-20 15:41

>>10
What else would you sort them based on? IHBT

Name: Anonymous 2011-01-20 15:57

I highly enjoyed this.

Name: Anonymous 2011-01-20 16:03

>>11
Not tail recursive.

Name: Anonymous 2011-01-20 16:08

>>14
Recurse my tail!

Name: Anonymous 2011-01-20 16:24

>>15
(tail (anus! 'my))

Name: Anonymous 2011-01-20 16:26

>>15
Intercourse under my tail!

Name: Anonymous 2011-01-20 16:28

If the difference between any two of the numbers is too small, race conditions will fuck you up the ass.

Name: Anonymous 2011-01-20 16:30

>>18
Luckily, 1 second should be enough for anyone.

Name: >>18 2011-01-20 16:32

like perhaps in:
./sleepsort 0.000002 0.000003 0.000001

Name: Anonymous 2011-01-20 16:38

What about
./sleepsort -1 -2 -3 ?

If you slept exp(n) instead of n it could easily include negative integers too!

Name: Anonymous 2011-01-20 17:12

This is sort of like a simple bucket/radix sort but instead of using a space-based array, it's effectivly using a time-based "array"

Name: Anonymous 2011-01-20 17:13

>>21
obviously the correct solution is to divide every input by two and add MAXINT/2.

Name: Anonymous 2011-01-20 17:16

>>23
OMG OPTIMIS-Oh, wait.

Name: Anonymous 2011-01-20 17:28

This thread is entertaining. My gratitude goes to all participators.

Name: Anonymous 2011-01-20 18:19

>>21,23-24
For optimal results, use a logistic function^{^{eg. 0.5+9.5/((1+0.5e^(-1.5(t-10)))^(2))}} to normalize the inputs. You can bound the sleep time arbitrarily this way. I'm not writing that in bash.

Name: Anonymous 2011-01-20 18:43

>>26
Still doesn't solve the race condition problem. Over here it happens with values with mutual differences as high as those in:
./sleepsort 0.02 0.03 0.01

Name: Anonymous 2011-01-20 19:47

using System;

using System.Collections.Generic;

using System.Collections.Concurrent;

using System.Linq;

using System.Threading;



namespace SleepSort

{

    public class SleepSort

    {

        static void Main(string[] args)

        {

            var xs = new[] { 11, 215, 12, 1985, 12, 1203, 12, 152 };

            var sorted = Sort(xs, x => x);

            Console.Write("Sorted:");

            foreach (var x in sorted)

                Console.Write(" {0}", x);

            Console.WriteLine();

            Console.ReadKey(true);

        }



        public static IEnumerable<T> Sort<T>(IEnumerable<T> xs, Func<T, int> conv)

        {

            const int WEIGHT = 40000;

            var ev = new EventWaitHandle(false, EventResetMode.ManualReset);

            var q = new Queue<T>();

            ParameterizedThreadStart f = x => { ev.WaitOne(); Thread.SpinWait(conv((T)x) * WEIGHT); lock (q) { q.Enqueue((T)x); } };

            var ts = xs.Select(x => { var t = new Thread(f); t.Start(x); return t; }).ToArray();

            ev.Set();

            foreach (var t in ts)

                t.Join();

            return q;

        }

    }

}

It's still a bit of a stochastic sort.

Name: Anonymous 2011-01-20 20:21

>>28
Lol I just tried to compile this in java, but I assume now that it's C#

Name: Anonymous 2011-01-20 20:30

>>27
Well no, in fact it makes the race condition worse. Many of the differences are going to be quite small indeed after coming out of that function.

I can think of a few enhancements:
First: tailor A and K^{^{http://en.wikipedia.org/wiki/Generalised_logistic_curve}} to the range of inputs. This adds some complexity, but it is nearly canceled by the act of spawning the sleeps and calculating Y(t) anyway.

Second: keep track of deltas upon return. When the gap is large enough relative to previous gaps^{^{Feigenbaum constant?}} start a new partition, reiterate the process on each. (Note: multiple partitions can be sleep-sorted at the same time.) This will distribute the sleep times more evenly among elements, however: there is still no guarantee on most platforms that any kind of sleep sort will be free of race conditions, on any set of inputs, no matter the minimum range between elements.

Third, a meta-enhancement: make best-guesses at values for the range chosen in the first enhancement for the purposes of optimal calculations. Likewise establish a good terminal condition for the second, probably when all partitions have 1 element.

If you have a huge range in input with many clusters, I think these variations are optimal over anything less sophisticated. I've no idea how often that is the case (actually... does anyone have info on this?) but it seems like it's probably common enough. Even if the clustering isn't bad, the partitioning process deals with it automatically.

Name: Anonymous 2011-01-20 20:48

>>30
lolwut

Name: Anonymous 2011-01-20 21:22

Good thread.

Name: Anonymous 2011-01-20 21:56

Yeah, that's pretty cool but check my doubles.

Name: Anonymous 2011-01-21 5:34

>>33
sweet dubs bro

Name: Anonymous 2011-01-21 5:39

Block the threads until every single one is created, also you should probably attempt to indicate to the OS that every thread doesn't need a very large stack.

Name: Anonymous 2011-01-21 5:54

Thread was better than I expected, nh OP.

Name: Anonymous 2011-01-21 6:17

>>35
Yes I was thinking about whether this algorithm could have potential use for a huge amount (eg billions) of numbers in a small range.. but i'm not sure which OS would handle billions of processes/threads... so like I said before it's essential a radix sort but in the time dimension.. the way around as others have said would be to have radix style buckets to group the numbers, then sort each bucket etc..

Name: Anonymous 2011-01-21 7:10

Oh shit, we're busted, there's a REALISTICALLY THINKING PERSON in this thread!

Name: Anonymous 2011-01-21 7:30

>>29
lol'd, but does Java have lambda expressions and var and LINQ? Didn't think so.

>>35
My implementation (>>28) blocks them, but even after letting them continue they won't all start at the exact same time.

Name: Anonymous 2011-01-21 7:38

Someone email this to Knuth.

Name: Anonymous 2011-01-21 8:01

>>40
Knuth doesn't do email anymore

Name: Anonymous 2011-01-21 8:05

>>41
That's only because he's DED.

Name: >>28 2011-01-21 8:31

-module(sleepsort).

-export([sort/2, spawn_waiters/3, wait/4]).



sort(Xs, Conv) ->

    spawn(?MODULE, spawn_waiters, [Xs, Conv, self()]),

    receive

        {spawned, N} -> queue(N)

    end.



queue(N) -> queue(N, []).

queue(0, Xs) ->

    lists:reverse(Xs);

queue(N, Xs) ->

    receive

        {item, X} ->

            queue(N - 1, [X|Xs])

    end.



spawn_waiters(Xs, Conv, P) -> spawn_waiters(P, Conv, Xs, 0).

spawn_waiters(P, _, [], N) ->

    P ! {spawned, N};

spawn_waiters(P, Conv, [X|Xs], N) ->

    spawn(?MODULE, wait, [X, Conv(X), P, self()]),

    receive

        monitored -> ok

    end,

    spawn_waiters(P, Conv, Xs, N + 1).



wait(X, T, Q, P) ->

    Ref = erlang:monitor(process, P),

    P ! monitored,

    receive

        {'DOWN', Ref, process, P, _} -> ok

    end,

    timer:sleep(T),

    Q ! {item, X}.

Also this. I'm an EARLY ADOPTER.

Name: Anonymous 2011-01-21 8:37



(module sleepsort racket

   (provide sleepsort)

   (define (sleepsort x)

      (map (lambda (x) (thread (lambda () (sleep x) (display x)))) x)))

Name: Anonymous 2011-01-21 8:40

>>44
display
Are you also one of the people that define their square as IO ()?

Name: Anonymous 2011-01-21 8:44

History in the making, guys. Turns out /prog/ can do good things.

Name: Anonymous 2011-01-21 8:47

>>43
Holy fuck Erlang in /prog/?!?!?!?!

Props.

Name: Anonymous 2011-01-21 8:47

>>45
Yes.

void CalculateAndPrintSquareEx(DWORD dwOperand, HANDLE hOutputDevice, ...) { fprintf(hOutputDevice, "%d", dwOperand*dwOperand); }

int main (int argc, char *argv[]) {

   CalculateAndPrintSquareEx(2, stdout, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL); }

Name: Anonymous 2011-01-21 8:54

>>48
That's :: Int -> IO ().
I was thinking more along the lines of ReadParseSquareAndOutput(...).

Name: Anonymous 2011-01-21 8:59

>>49
That's

:: DoubleWord -> Handle -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> Nothing -> IO ()

.

Name: Anonymous 2011-01-21 9:12

>>50
More like

:: Int32 -> IORef -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a -> IO ()

_{(I counted.)}

Name: Anonymous 2011-01-21 9:16

>>51
Maybe (Ptr a)

Name: Anonymous 2011-01-21 9:20

>>51
Wait, fuck. That should be:
_{_{CalculateAndPrintSquareEx :: Int32 -> IORef -> Maybe a -> Maybe b -> Maybe c -> Maybe d -> Maybe e -> Maybe f -> Maybe g -> Maybe h -> Maybe i -> Maybe j -> Maybe k -> Maybe l -> Maybe m -> Maybe n -> Maybe o -> Maybe p -> Maybe q -> Maybe r -> Maybe s -> Maybe t -> Maybe u -> Maybe v -> Maybe w -> Maybe x -> Maybe y -> Maybe z -> Maybe a' -> Maybe b' -> Maybe c' -> Maybe d' -> Maybe e' -> Maybe f' -> Maybe g' -> Maybe h' -> Maybe i' -> Maybe j' -> Maybe k' -> Maybe l' -> Maybe m' -> Maybe n' -> Maybe o' -> Maybe p' -> Maybe q' -> Maybe r' -> Maybe s' -> Maybe t' -> Maybe u' -> Maybe v' -> Maybe w' -> Maybe x' -> Maybe y' -> Maybe z' -> Maybe a'' -> Maybe b'' -> Maybe c'' -> Maybe d'' -> Maybe e'' -> Maybe f'' -> Maybe g'' -> Maybe h'' -> Maybe i'' -> Maybe j'' -> Maybe k'' -> Maybe l'' -> Maybe m'' -> Maybe n'' -> Maybe o'' -> Maybe p'' -> Maybe q'' -> Maybe r'' -> Maybe s'' -> Maybe t'' -> Maybe u'' -> Maybe v'' -> Maybe w'' -> Maybe x'' -> Maybe y'' -> Maybe z'' -> Maybe a''' -> Maybe b''' -> Maybe c''' -> Maybe d''' -> Maybe e''' -> Maybe f''' -> Maybe g''' -> Maybe h''' -> Maybe i''' -> Maybe j''' -> Maybe k''' -> IO ()}}

Name: Anonymous 2011-01-21 12:23

oh thread is officially shit now. congrats /prog/

Name: Anonymous 2011-01-21 12:31

>>54
np faggot

Name: Anonymous 2011-01-21 12:46

>>55
nobody likes you and nobody would miss you

Name: Anonymous 2011-01-21 13:10

>>56
girls dont like you

Name: Anonymous 2011-01-21 13:16

>>57
Apostrophes and capital letters don't like you.

Name: Anonymous 2011-01-21 15:03

>>58
girl's Dont like you

Name: Anonymous 2011-01-21 15:17

your gay

Name: Anonymous 2011-01-21 15:23

The Autism Consortium frowns upon this thread.

Name: Anonymous 2011-01-21 15:24

To the person reading this in the future, >>54-60 are from something which we call an ``imageboard'', more specifically the imageboard called ``/g/'', this means that they enjoy making bad posts with little to no-content.

Name: Anonymous 2011-01-21 15:26

>>62
I lol'd!

Name: Anonymous 2011-01-21 16:11

>>62
nice.

Name: Anonymous 2011-01-21 16:52

>>63,64
NOOOOooooooOOOOOOOOoooooooooooOOOOOOOOoooo

Name: Anonymous 2011-01-21 16:54

>>65
nice.

Name: Anonymous 2011-01-21 17:21

>>65
I lol'd

Name: Anonymous 2011-01-21 18:00

>>65
I bet you miss ``_HAXMY^ANUS'' now, motherfucker.

Name: Anonymous 2011-01-21 18:00

>>1
Good job. Now try writing it in an actual language, like C.

Name: Anonymous 2011-01-21 18:08

Hax Anii everyday.
Anii MUST be haxxed.

Name: Anonymous 2011-01-21 18:47

>>69

My implementations of sleep and echo are written in C.

Name: Anonymous 2011-01-21 18:54

>>69
ooh no i'd have to use pipe() and fork() !

Name: Anonymous 2011-01-21 19:02

>>71
That's like saying you wrote a hardware implementation of sleepsort because it's run on hardware.

Name: Anonymous 2011-01-21 19:05

>>73

Well most of the time in that script is spent in those programs, if your intention was to optimize it by writing it in C it wouldn't work.

Name: Anonymous 2011-01-21 19:23

>>72
pipe()
What for? Sounds like this would be an actual challenge to you.

Name: Anonymous 2011-01-21 20:29

>>74
>>69 is just being a turd. A big part of the novelty here is that it's a shell script.

Name: Anonymous 2011-01-22 5:38

>>75
to set up a signalling channel

Name: Anonymous 2011-02-02 13:39

I think thats brilliant :)
Would be fun to design a hardware sorter, based on this..
hmm, something to think about after my partials.

Name: Anonymous 2011-02-02 14:33

#include <assert.h>

#include <stdio.h>

#include <unistd.h>



int main(int argc, char **argv)

{

        assert(argc >= 2);

        while (argc --> 2 && fork()) ;

        sleep(atoi(argv[argc]));

        puts(argv[argc]);

        while (wait(NULL) != -1) ;

}

Name: Anonymous 2011-02-02 14:49

>>79
+1 use of goes-to operator

Name: Anonymous 2011-03-30 16:47

THIS IS A MESSAGE FROM THE SUSSIX DEV TEAM (ME)

/*

 * Inspired by the valiant /prog/lodtyes

 * one of my personalities wrote an OMP

 * implementation.

 *

 * Since we are currently training SCC

 * (SCC Compiles C) we currently have to

 * use GCC to compile it.

 */



/*

 * @file sleepsort.c

 * @brief sorts numbers

 *

 * @compile gcc sleepsort.c -fopenmp -o sleepsort

 *

 * @author Gerald Jay Sussman (Massachvsetts Institvte of Technology)

 *

 * Copyright (C) 2011 Gerald Jay Sussman and the Massachvsetts

 * Institvte of Technology. All rights reserved.

 *

 * The new BSD License is applied to this software, see LICENSE.txt

 */



#include <stdio.h>

#include <stdlib.h>

#include <omp.h>



int main(int argc, char **argv) {

  int i;



  omp_set_num_threads(argc);



#pragma omp parallel for

  for (i = 0; i < argc - 1; i++) {

    long int this = atol(argv[i+1]);



    sleep(this);



    printf("%ld\n", this);

    fflush(stdout);

  }



  return 0;

}

THIS HAS BEEN A MESSAGE FROM THE SUSSIX DEV TEAM (ME)

Name: Anonymous 2011-03-30 17:26

Is Quantum Sleepsort O(1)?

Name: Anonymous 2011-03-30 18:07

My shitty attempt in Haskell... first time I ever used Control.Concurrent



import Control.Concurrent

import System.Posix.Unistd (sleep)



sleepFunc :: MVar [Int] -> Int -> IO ()

sleepFunc arr n = do

    sleep n

    xs <- takeMVar arr

    putMVar arr (n:xs)

    

sleepSort_ :: [Int] -> IO [Int]

sleepSort_ xs = do

    res <- newMVar []

    let ts = map (sleepFunc res) xs

    mapM_ forkIO ts

    waitForIt res (length xs)

    

    

waitForIt m n = do

    arr <- takeMVar m

    if length arr == n

       then return $ reverse arr

       else do

           putMVar m arr

           sleep 1

           waitForIt m n

Name: Anonymous 2011-03-30 18:17

>>82
It's still O(n), but without the race condition problems.

Name: Anonymous 2011-03-30 22:22

>>48
wat, the function should return a BOOL

Name: Anonymous 2011-03-31 1:35

Just run an insertion sort over the output if you're worried about race conditions. This ensures that the numbers are relatively close to their ending points.

Name: Anonymous 2011-03-31 6:01

>>81
Is threading in C really this simple?

Name: Anonymous 2011-03-31 8:10

>>87
Only with that OMP thing

Name: Anonymous 2011-03-31 8:37

>>87
Only with #pragma omp everyline

Name: Anonymous 2011-03-31 9:00

Perl ^Legacy:

map {sleep $_; print "$_\n"} @ARGV;

Name: Anonymous 2011-03-31 9:01

>>90
Shorter than ``in Lisp'' DSL.

Name: Anonymous 2011-03-31 9:06

>>91
YHBT

Name: Anonymous 2011-03-31 9:08

>>90
Perl's map is parallel?

Name: Anonymous 2011-03-31 10:48

Actual Perl implementation. Forking in Perl is awkward to say the least.



#!/usr/bin/perl                                                                 

sub f {

  sleep $_[0];

  print "$_[0]\n";

}



for (0..$#ARGV) {

  $pid = fork();

  if ($pid) {

    # parent                                                                    

  push(@childs, $pid);

}

  if ($pid == 0) {

    # child                                                                     

    &f(@ARGV[$_]);

    exit(0);

  }

}

foreach (@childs) {

waitpid($_, 0);

}

time perl sleepsort.pl 3 1 8 2 9 5 4
1
2
3
4
5
8
9

real 0m9.007s
user 0m0.008s
sys 0m0.000s

Terribly inaccurate with anything other than integers, but you can give arguments like 0.003 "sqrt(2)" 10e-3, for what it's worth.

Name: Anonymous 2011-03-31 20:49

Name: Anonymous 2011-03-31 20:58

way to ruin a good python thread

Name: Anonymous 2011-03-31 22:44

If you're sorting very large groups of numbers, unless your CPU can spawn the necessary number of threads, the accuracy will be compromised by shit like thread quantums.

Name: Anonymous 2011-03-31 22:50

svn checkout my://dubs

Name: Anonymous 2011-03-31 22:50

At revision 99.

Name: Anonymous 2011-03-31 22:51

one hundubs

Name: Anonymous 2011-03-31 23:22

>>98,99
That might surprise you, but your gay.

Name: Anonymous 2011-03-31 23:35

>>101
what about my gay?

Name: BLACK HITLER 2011-04-01 1:52

    ░░░░░░░░░░░░░░░▄░░░░░░░░░░░░░░░
    ░░░░░░░░░░░░░▄▀█░░░░░░░░░░░░░░░
    ░░░░░░░░░░░▄▀░░█░░░░░░░░░░░░░░░
    ░░░░░░░░░▄▀░░▄▀░░░░░░░░░░░░░░░░
    ░░░░░░░░█▄░▄▀░░░░░░░░▄█▄░░░░░░░
    ░░░░░░░░█░▀▄░░░░░░░▄▀░█░▀▄░░░░░
    ░░░░░░░░▀▄░░▀▄░░░▄▀░░▄▀▄░░▀▄░░░
    ░▄░░░░░░░░▀▄░░▀▄▀░░▄▀░░░▀▄░░▀▄░
    ░█▀▄░░░░░░░░▀▄▀█▀▄▀░░░░░░░▀▄░█░
    ░█░░▀▄░░░░░▄▀░░█░░▀▄░░░░░░░░▀█░
    ░░▀▄░░▀▄░▄▀░░▄▀░▀▄░░▀▄░░░░░░░░░
    ░░░░▀▄░░█░░▄▀░░░░░▀▄░▄█░░░░░░░░
    ░░░░░░▀▄█▄▀░░░░░░░░▄▀░█░░░░░░░░
    ░░░░░░░░▀░░░░░░░░▄▀░░▄▀░░░░░░░░
    ░░░░░░░░░░░░░░░▄▀░░▄▀░░░░░░░░░░
    ░░░░░░░░░░░░░░░█░▄▀░░░░░░░░░░░░
    ░░░░░░░░░░░░░░░█▀░░░░░░░░░░░░░░
    ░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░
    ░█▄░█░█░▄▀▀▄░░█░░█░█▀▀░▀█▀░█░░░
    ░█░█▄░█░█░▄▄░░█▄▄█░█▄▄░░█░░█░░░
    ░█░░█░█░▀▄▄▀░░█░░█░█▄▄░▄█▄░█▄▄░
    ░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░



glory BLACK AFRIKA

HEIL NIGGERS.

HEIL BLACK AFRIKA.

NIG HEIL BLACK HITLER!

Name: Anonymous 2011-04-01 2:13



int main(int argc, char **argv)

{

  int i, j, n = 0;



  for (i = 0; n < argc; i++)

    for (j = 0; j < argc; j++)

      if (atoi(argv[j]) == i)

      {

        printf(argv[j]);

        n++;

      }



  return 0;

}

Name: Anonymous 2011-04-01 2:18

Name: Anonymous 2011-04-01 5:57

>>104

So you managed to make a failed O(n²) version which usually won't even work whilst failing to even include the correct headers?

Congratulations.

Name: Anonymous 2011-05-17 19:31

This is a GOOD sorting algorhythm and /prog/ should be proud of it.

Name: anonymous 2011-05-17 19:51

http://www.facebook.com/pages/Life-As-We-Knew-It/109940742427550#!/pages/Life-As-We-Knew-It/109940742427550

Name: Anonymous 2011-05-17 20:08

Woah this thread is still going? OP here, and I've given up on prog the last few months after it went downhill (possibly partly my fault as I brought check my dubs ^__^ here. But now I'm back as I'm very bored this evening.

Recently I've been worked on a delicious object system for C with smalltalk style messaging. Actaully it's pointless but sort of fun. It could be used as the basis of ruby-style language intepreter or something.

Name: Anonymous 2011-05-17 21:29

You totally fucked up /prog/ whith the checkdubs thing. And when copycats appeared you left...

Anyway this thread and the sleep sort algorithm were fun.

Name: Anonymous 2011-05-18 0:00

>>94,96

See >>26,30 for notes on getting more accuracy, and reduced time requirements when large values are involved.

Bonus Perl 6 version: @foo = @foo>>.&sleep;
Sadly in situ and hyper are incompatible: @foo>>.=&sleep($n); # fails

Name: >>111 2011-05-18 0:01

Shite. Disregard the $n.

Name: Anonymous 2011-05-18 20:03

>>1
Funny. I am impressed.
I copyed 1's script to "UNIX Shell Script Overall" in 2ch.
http://hibari.2ch.net/test/read.cgi/unix/1290209379/754

754 at http://hibari.2ch.net/test/read.cgi/unix/1290209379

I hope U don't mind it.

Name: Anonymous 2011-05-19 1:05

>>113
Wow, they actually praised us.
Bump great thread.

Name: Anonymous 2011-05-19 16:03

>>94
what?
perl -E 'fork and sleep $_ and say $_ and exit for @ARGV'

Name: Anonymous 2011-05-19 18:17

>>115
That's kinda useless. You need to capture the output, hence waitpid.

Not that I find forking in Perl any more awkward than forking in C. But for Perl I suppose it's fair to call it awkward since there's no DWIM involved.

Name: Anonymous 2011-05-19 18:41

>>116
fork and sleep $_, say, last for @ARGV; 1 while 1 <=> -wait

Name: Anonymous 2011-05-19 20:06

This has a best case O(n) and an infinity high worst case. (because its 0(n * Constant) and the constant could be much greater than n)

Name: Anonymous 2011-05-19 20:44

>>118
It's not a constant, it's an argument, it's O(n*k).

Name: Anonymous 2011-05-19 22:06

And I thought my shuffle sort was genius:



#include <cstdlib>

#include <ctime>

#include <vector>

#include <algorithm>

#include <iostream>



template<typename T>

void f (T i) {

        std::cout << i << " ";

}



int main(int argc, char **argv) {

        bool good;

        std::vector<int> v;



        for (int i = 1; i < argc; i++)

                v.push_back(atoi(argv[i]));



        do {

                good = true;

                std::random_shuffle(v.begin(), v.end());

                for (int i = 0; i < argc - 2 && good; i++)

                        good = v[i] <= v[i+1];

        } while (!good);



        std::for_each(v.begin(), v.end(), f<int>);

        std::cout << std::endl;



        return 0;

}



$ g++ -o shuffle_sort shuffle_sort.cc && ./shuffle_sort 6 4 2 1 3 5

1 2 3 4 5 6

Name: Anonymous 2011-05-19 22:11

>>120
You reinvented Bogosort: http://en.wikipedia.org/wiki/Bogosort

Name: Anonymous 2011-05-19 22:17

>>121
Ah damnit.

Name: Anonymous 2011-05-19 23:34

>>2 >>5
if accept that floating-point sleep and scrpipt have only to sort with natural numbers...

#!/bin/bash
function f() {
sleep $(echo "($2 - 1) + $1 / 10 ^ $2" | bc -l)
echo "$1"
}
while [ -n "$1" ]
do
f "$1" $(echo -n "$1" | wc -c) &
shift
done
wait

example: 218382 -> 5.218382 seconds.

Name: Anonymous 2011-05-20 4:27

>>118
What are you talking about?

O(n*k) with fixed k is just O(n) for all nonzero finite k.

Name: Anonymous 2011-05-20 23:24

Cosmological sort

Wait for the universe to collapse and be replaced by a universe in which the input is in sorted order

Name: Anonymous 2011-05-20 23:28

>>125
http://en.wikipedia.org/wiki/Everett_many-worlds_interpretation

Name: Anonymous 2011-05-20 23:28

>>125
You reinvented (Quantum) Bogosort, again: http://en.wikipedia.org/wiki/Bogosort#Quantum_bogosort

Name: Anonymous 2011-05-20 23:34

>>125
What if the new universe would have the same initial conditions and thus the input will always be in unsorted order?

Name: Anonymous 2011-05-20 23:46

>>128
Destroy the universe, take another one.

Name: Anonymous 2011-05-20 23:51

I think of sleepsort as a deferred kernelspace-sort.

Name: kissrobber 2011-05-28 0:50

Hello.
I invented a new sorting algorithm in the Cloud age.
It's called the "Cloud Sort（Google App Engine TaskQueue Sort）".
http://d.hatena.ne.jp/kissrobber/20110527/1306508583

This use GAE TaskQueue(eta) instead of Sleep.
(http://code.google.com/appengine/docs/python/taskqueue/tasks.html)

Specifications:
・The order of the sort result is not guaranteed.
・Sometimes, a part of sorted data is duplicated.

Name: Anonymous 2011-05-28 1:23

・The order of the sort result is not guaranteed.
・Sometimes, a part of sorted data is duplicated

( ≖‿≖)

Name: Anonymous 2011-05-28 3:47

It's O(n²) under the hood because the kernel has to scan the list of waiting threads every pass through the idle loop. It's only O(n) if you have n CPUs, in which case you should be using n-way mergesort, since that has already been shown to give O(log n) time.

Remember, guys: the OS is not magic, and just because you didn't take an OS design course doesn't make you a wizard.

Only LispM designers get to be wizards.

Name: Anonymous 2011-05-28 3:52

>>133
Sorry, correction about the merge sort; I was remembering it incorrectly: http://drdobbs.com/high-performance-computing/229400239

Name: Anonymous 2011-05-28 4:01

Only LispM designers get to be faggots.

Name: Anonymous 2011-05-28 18:12

The Jews are after me

Name: Anonymous 2011-06-15 12:28

A very similar approach is MRSI sort using an array of AMOS delayed event generators.

Name: jon 2011-06-15 13:19

>>94

Here's a quick (3-minute) attempt at Perl golf:

#!/usr/bin/perl -l -MTime::HiRes=sleep
$SIG{CHLD} = sub { };
push @p, (fork or sleep($_), print, exit) for @ARGV;
waitpid $_, 0 for @p;

>>44

Has flaws: first, you get the numbers without spacing, which is bad; second, you get them to stdout instead as the procedure's result, which is un-Racket-like. Here are some alternatives, indented/linebreaked for clarity, not brevity:

(define (sleepsort1 lst)
(with-input-from-string
   (with-output-to-string
    (λ () (map thread-wait
   (map (λ (x) (thread (λ () (sleep x) (printf "~a " x)))) lst))))
   (λ () (port->list read))))

(define (sleepsort2 lst)
(define me (current-thread))
(map thread-wait
   (map (λ (n) (thread (λ () (sleep n) (thread-send me n))))
      lst))
(sequence->list (in-producer thread-try-receive false?)))

(define (sleepsort3 lst)
(define-values (i o) (make-pipe-with-specials))
(map thread-wait
   (map (λ (n) (thread (λ () (sleep n) (write-special n o))))
      lst))
(close-output-port o)
(port->list read-char-or-special i))

The second is my favorite, I think, but it assumes nothing else will be sending to its thread. If you didn't mind (require racket/async-channel), you could replace (current-thread) with (make-async-channel), thread-send with async-channel-put, and thread-try-receive with (λ () (async-channel-get me)) which solves that problem.

Name: Anonymous 2011-06-15 13:30

HI REDDIT!!!

Name: Anonymous 2011-06-15 13:40

hi paul graham!!

Name: jon 2011-06-15 13:40

>>173

nice.

Name: Anonymous 2011-06-15 14:10

The fags code like cookies dipped in milk. Soggy and gross.

Name: KalEl 2011-06-15 14:16

Fixed. Sorts including negative values, sorts any numbers within 1 second.

#!/bin/bash
function f() {
    sleep $(echo "scale=10; 1/(1+1.1^(-$1))" | bc)
    echo "$1"
}
while [ -n "$1" ]
do
    f "$1" &
    shift
done
wait

Name: Anonymous 2011-06-15 15:11

Greetings from reddit.

Your creation is much better than anything I've ever seen on /r/programming before!

Name: mike 2011-06-15 15:14

Name: foo 2011-06-15 15:20

Don't think there was a Python version, so here we go.
It's 'optimized' by waiting only 1/4th of the seconds
in each thread.

#!/usr/bin/python

import sys, time, threading

def sleepit(val):
    time.sleep(val/4.0)
    print val

[ threading.Thread(target=sleepit, args=[int(a)]).start() for a in sys.argv[1:] ]

Name: Anonymous 2011-06-15 15:25

   var numbers = process.argv.slice(2)
   , output   = []
   , negative = []

   for (var i=0, ln=numbers.length; i<ln; i++){
      var n = +numbers[i]
      setTimeout((function(n){ return function(){
   if (n<0) negative.unshift(n)
   else output.push(n)
   if (output.length + negative.length === numbers.length) {
      return console.log(negative.concat(output))
   }
      }})(n), Math.abs(n)/1000)
   }

    $ node sleepsort -2 1 0.1 4 -1 7 -3 9
    [ -3, -2, -1, 0.1, 1, 4, 7, 9 ]

Name: Anonymous 2011-06-15 15:32

DIGG SENT ME HERE!

Name: Anonymous 2011-06-15 15:47

PLEASE DO NOT INCREASE THE POPULATION OF /prog/ BEYOND 3, THANKS!!!

Name: Anonymous 2011-06-15 15:50

F#:
let sleepsort (xs: int list) =
for x in xs do Async.Start <| async { Threading.Thread.Sleep x; printfn "%d" x }

Name: Anonymous 2011-06-15 15:54

All this talk of new different versions, yet I see no code.

Name: Anonymous 2011-06-15 15:54

it is vulnerable to race conditions

Name: Anonymous 2011-06-15 16:09

Ruby:
def f(i)
    sleep i
    puts i
end

[3,2,3,4,2,1].each do |i|
Kernel.fork {
    f(i)
}
end

Name: Anonymous 2011-06-15 16:09

Hacker New up in this bitch

Name: Anonymous 2011-06-15 16:14

>>152
That's been addressed at least 3 times already.

Name: Anonymous 2011-06-15 16:46

vals = [100, 25, 3,2,1]

sorted = (vals.min..vals.max).to_a.select{ |i|
vals.include? i
}

Name: Anonymous 2011-06-15 17:28

>>131
LOL

Name: Anonymous 2011-06-15 17:31

you are sick

Name: sharkdabark 2011-06-15 18:02

Doesn't work.
./sleepsort.bash 1.00001 1
1.00001
1

Name: Anonymous 2011-06-15 18:08

>>159
Serious question, are you autistic or just retarded?

Name: Anonymous 2011-06-15 18:12

This thread is way too popular. Front page of Reddit and Hacker News. I fear this may be the end for /prog/

Name: the dude 2011-06-15 18:18

it ends right here right now!

NULL

Name: Anonymous 2011-06-15 18:37

http://www.reddit.com/r/programming/comments/i0dcx/4chan_sleep_sort/c1zudzw

God fucking damn it. What sort of community awards points for being a fucking moron?

Name: Anonymous 2011-06-15 19:05

Today is a terrible day for /prog/. Fucking Paul Graham bimbos and groupies all over *my* /prog/ ?

Name: Rena 2011-06-15 19:11

#!/usr/bin/env lua
function sleepsort(arr)
    local res, thread = {}, {}
    local nthreads = #arr

    for i = 1, #arr do
      thread[i] = coroutine.create(function()
      for n=arr[i], 0, -1 do coroutine.yield() end
      nthreads = nthreads - 1
      thread[i] = nil
      res[#res+1] = arr[i]
      end)
    end
    while nthreads > 0 do
      for i = 1, #arr do
      if thread[i] then coroutine.resume(thread[i]) end
      end
    end
    return res
end

math.randomseed(os.time())
local arr = {}
for i = 1,10 do arr[i] = math.random(1,99) end
print(unpack(sleepsort(arr)))

This version also works much faster than the original script. (And faster still with LuaJIT!)

Name: Rena 2011-06-15 19:15

Oh yeah, and no race conditions either :)

Name: Anonymous 2011-06-15 19:44

>>133

If your scheduler is not at least O(log n) you should kill yourself.

It only took linux 9 years to get a O(1) one... and then threw it out for a O(log n) one because someone was butthurt about their porn skipping in mplayer because of f@h.

Name: Anonymous 2011-06-15 19:56

it is vulnerable to race conditions

Name: Anonymous 2011-06-15 20:06

GOD DAMN REDDIT

Name: Anonymous 2011-06-15 20:07

>>153
Let's play some golf! Here's a simplified version of yours that accepts any inputs and doesn't require any functions:

#!/usr/bin/env ruby
ARGV.each { |e| fork { sleep(e.to_f/1000); puts e } }

Also, it's much faster, since it's sleeping milliseconds instead of seconds now. You could probably toss more zeroes in, but I'm not sure if that would actually make a difference past what I've got.

Name: bowsersenior 2011-06-15 20:33

>>170

Very nice! I put it in a gist for posterity:
* https://gist.github.com/1028467

Name: Anonymous 2011-06-15 20:55

Hey /prog/lodytes. I propose a game: guess which of new posters are from reddit and which are from HN based on the contents of their posts.

My guess is all this torrid Ruby code is coming from reddit.

Name: Anonymous 2011-06-15 21:14

>>141

fork

Name: Anonymous 2011-06-15 21:15

>>141

Y?????

Name: Anonymous 2011-06-15 22:35

>>163
Reddit upvotes aren't rewards, they're indicators that a comment is "relevant to the discussion"

In this case, others are wondering how it works. I read this whole thread and can see half of you don't know the answer to that either, so the question is relevant.

Name: Anonymous 2011-06-15 22:42

I read this whole thread and can see half of you don't know the answer to that either, so the question is relevant.
I read your whole post and can see that either you're a liar or have terrible reading comprehension skills.

Name: Anonymous 2011-06-15 22:54

>>172
If the post is a fucking idiot, they are from reddit.

Name: Anonymous 2011-06-15 22:57

I don't get it

Name: Q 2011-06-15 23:00

This works as long as the time dimension of spacetime is strictly following a linear ordering of events. So your plebeian Newtonian algorithm may fail miserably, depending.

Name: Anonymous 2011-06-15 23:15

brainfuck implementation:

,>,>++++++++[<------<------>>-]
<<[>[>+>+<<-]>>[<<+,>,>++++++++[<------<------>>-]
<<[ ----------[++++++++++>----------]++++++++++
>[>+>+<<-]>>[<<+>>-]<<<-]
>>>++++++[<++++++++>-]<.>.>>-]<<<-]
,----------[----------------------.,----------]
,---<<<+>>>-------[----------------------.,----------]
>> ----------[++++++++++>----------]++++++++++
>++++++[<++++++++>-]< ----------[++++++++++>----------]++++++++++
.>. ----------[++++++++++>----------]++++++++++
>++>+<<-]>>[<<+>>-]<<<-]
>>[>[>+>+<<-]>>[<<----------[++++++++++>----------]++++++++++
>++,>,>++++++++[<------<------>>-]
<<

Name: Anonymous 2011-06-15 23:39

Linux scheduler was O(n) before 2.6

Name: Anonymous 2011-06-15 23:44

>>181
The kernel still has to take n cycles to execute each scheduled event. Ergo, time usage is O(n²) no matter how you (slur here)s want to frame it.

Name: Anonymous 2011-06-15 23:53

Access ^{my ^anus} in linear time.

Name: Anonymous 2011-06-15 23:59

>>183
But it will take exponential space!

Name: Anonymous 2011-06-16 0:13

>>179
Can it or I'll be forced to write a sort algorithm with imaginary complexity.

>>182
Why are you counting n twice? I see no sage, so I suspect you're from reddit rather than actually trolling.

Name: Anonymous 2011-06-16 0:29

>>185
Redditors can't ^B_BCode.

Name: Anonymous 2011-06-16 1:00

>>186
Aw shit. I didn't think any /prog/lodyte was genuinely that stupid.

Name: Anonymous 2011-06-16 1:09

>>179
Oh shit!

Name: Anonymous 2011-06-16 1:10

>>185
182 here. It was a thinking error, based on the absurd assumption that the scheduler doesn't sort. And yes, _I can ^B_BCode till your heart stops.

My remaining point is that, whatever algorithm the scheduler uses, all sleepsort does is pop items off it in slow motion (or not-so-slow motion if you can get a precise enough timing signal.) There's no good reason to not simply implement the scheduler's algorithm directly, instead.

Name: Anonymous 2011-06-16 1:53

>>189
There's no good reason to not simply implement the scheduler's algorithm directly, instead.
Are you one of those people who get pissed off when they see others having fun?

Sleepsort isn't genius because it's a great sorting algorithm, it's genius because it's a subtle joke, a play on the fact that we tend to measure only in-process time complexity.

Name: Anonymous 2011-06-16 1:55

i just joined in on a piece of history.

congrats OP

Name: Anonymous 2011-06-16 2:06

>>175
stfu faggot

Name: Anonymous 2011-06-16 2:09

>>192
Heh. If you want to get angry about something, check out the post in the HN thread where buddy is comparing sage to downvotes.

Name: Anonymous 2011-06-16 2:14

>>193
Every EXPERT PROGRAMMER knows that HN is for cockmonglers who dont read SICP

Name: Anonymous 2011-06-16 2:41

Is it web scale?

I mean, can I replicate it, then shard?

And one more thing: when you plan your IPO?

Name: Anonymous 2011-06-16 2:46

Comment->next = NULL;

now stop it...

Name: Anonymous 2011-06-16 2:53

>>1-196



                                                 

                        _,-%/%|                  

                    _,-'    \//%\                

                _,-'        \%/|%                

              / / )    __,--  /%\                

              \__/_,-'%(%  ;  %)%                

                      %\%,   %\                  

                        '--%'                    

                                                 

                                                .

Name: Anonymous 2011-06-16 3:39

<?php
$pids = array();
for ($i=1; $i<$argc; $i++)
{
      if (($pid = pcntl_fork()) == 0)
      {
      $sleep = intval($argv[$i]);
      sleep($sleep);
      echo $sleep."\n";
      exit();
      }
      else if ($pid == -1)
      {
      die();
      }
      else
      {
      $pids[] = $pid;
      }
}

foreach($pids as $pid)
      pcntl_waitpid($pid, $status);
?>

php sleepsort.php 1 3 5 6 2

php version ^ ^

Name: Anonymous 2011-06-16 3:43

This is already covered in SICP chapter 1.2.4 Exponentiation[1], in which they implement sleep sort with continuation-based coroutines.

[1]: Sorting integrals: http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-11.html#%_sec_1.2.4

Name: Anonymous 2011-06-16 3:48

>>198
Take your toy language and kindly take your coat and go fuck yourself.

Name: Anonymous 2011-06-16 3:54

>>200
are you calling coldfusion a toy lang? you clearly havent done enterprise development

Name: Anonymous 2011-06-16 4:00

>>200
so sick，mother fucker

Name: Anonymous 2011-06-16 4:06

sb sb

Name: Anonymous 2011-06-16 4:08

>>200
sb sb

Name: Anonymous 2011-06-16 4:19

fu

Name: Anonymous 2011-06-16 4:37

Who the fuck posted this to Reddit? God damn it.

Name: Anonymous 2011-06-16 4:40

import Control.Concurrent;

sleepsort = mapM_ $ forkIO . (\i -> threadDelay (i * 1000000) >> print i)

main = do
sleepsort [1, 5, 3, 7, 8, 5, 3, 2, 6, 1, 6]
threadDelay 10000000

Name: Anonymous 2011-06-16 4:54

I heartily disagree with all the attempts to downplay the brilliance of the sleep sort algorithm. Many of you have missed the important point that while traditional sorting algorithms can only utilize one core, sleep sort has the capacity to use the full power of a massively parallel execution environment.

Given that you need nearly no computing in each of the threads, you can implement them using low-power CPUs, so this is in fact a GREEN COMPUTING algorithm.

Oh, and did I mention that the algorithm can also run inside a cloud...?

Sure, you're a genius!

Name: Anonymous 2011-06-16 4:55

Isn't this something GPGPUs are made for?

Name: Anonymous 2011-06-16 4:57

How about adding the n time that is needed to iterate through all elements and then cut sleep time like $1/1000, it will complete with 1000 times faster ??

Name: Anonymous 2011-06-16 5:00

>>210
it is still linear so does not matter

Name: Anonymous 2011-06-16 5:17

Code on 4chan??

Where is the lolcats?? :D

Name: Once 2011-06-16 5:24

n input num map to [0,x], cost O(n)
get niubility cpu support usleep(time) with min time=x/n (second)
the algorithm is O(n)+x second

Name: Anonymous 2011-06-16 5:37

This was such a good thread, it's ruined now ;_;

Name: Anony-mouse 2011-06-16 5:37

Now I'm waiting for some *fag-sort* to get discovered. See simple and time saver. ;)

Name: Anonymous 2011-06-16 5:39

<>

Name: Anonymous 2011-06-16 5:43

>>214
`>implying every thread on /prog/ isn't ruined from the start by design

Name: Anonymous 2011-06-16 5:47

>>217
I'd rather have the thread die because of ``autism'' spam than because of the people from reddit.

Name: AK 2011-06-16 5:57

you guys suck

Name: Anonymous 2011-06-16 6:31

>>201 you clearly don't get it, do you?

Name: Anonymous 2011-06-16 6:47

//golang

package main

import (
    "fmt"
    "time"
)

func main() {
    tab := []int{1, 3, 0, 5}

    ch := make(chan int)
    for _, value := range tab {
      go func(val int){
      time.Sleep( int64(val)*10000000 )
      fmt.Println(val)
      ch <-val
      }(value)
    }

    for _ = range tab {
   <-ch
    }
}

Name: Anonymous 2011-06-16 6:54

check my trebs ^__^

Name: Anonymous 2011-06-16 6:55

>>221
Go
``Please" don't.

Name: Anonymous 2011-06-16 6:58

Who are all the faggot retards who are taking this shit seriously?

R^{E^{T^{A^{R^{D^{^{T^{H^{R^{E^{A^{D^{^{I^{S^{^{R^{E^{T^{A^{R^D}}}}}}}}}}}}}}}}}}}}}

Name: Anonymous 2011-06-16 7:17



                                                 

                        _,-%/%|                  

                    _,-'    \//%\                

                _,-'        \%/|%                

              / / )    __,--  /%\                

              \__/_,-'%(%  ;  %)%                

                      %\%,   %\                  

                        '--%'                    

                                                 

                                                 .



                                                 

                        _,-%/%|                  

                    _,-'    \//%\                

                _,-'        \%/|%                

              / / )    __,--  /%\                

              \__/_,-'%(%  ;  %)%                

                      %\%,   %\                  

                        '--%'                    

                                                 

                                                 .



                                                 

                        _,-%/%|                  

                    _,-'    \//%\                

                _,-'        \%/|%                

              / / )    __,--  /%\                

              \__/_,-'%(%  ;  %)%                

                      %\%,   %\                  

                        '--%'                    

                                                 

                                                 .



                                                 

                        _,-%/%|                  

                    _,-'    \//%\                

                _,-'        \%/|%                

              / / )    __,--  /%\                

              \__/_,-'%(%  ;  %)%                

                      %\%,   %\                  

                        '--%'                    

                                                 

                                                 .



                                                 

                        _,-%/%|                  

                    _,-'    \//%\                

                _,-'        \%/|%                

              / / )    __,--  /%\                

              \__/_,-'%(%  ;  %)%                

                      %\%,   %\                  

                        '--%'                    

                                                 

                                                 .



                                                 

                        _,-%/%|                  

                    _,-'    \//%\                

                _,-'        \%/|%                

              / / )    __,--  /%\                

              \__/_,-'%(%  ;  %)%                

                      %\%,   %\                  

                        '--%'                    

                                                 

                                                 .



                                                 

                        _,-%/%|                  

                    _,-'    \//%\                

                _,-'        \%/|%                

              / / )    __,--  /%\                

              \__/_,-'%(%  ;  %)%                

                      %\%,   %\                  

                        '--%'                    

                                                 

                                                 .



                                                 

                        _,-%/%|                  

                    _,-'    \//%\                

                _,-'        \%/|%                

              / / )    __,--  /%\                

              \__/_,-'%(%  ;  %)%                

                      %\%,   %\                  

                        '--%'                    

                                                 

                                                 .



                                                 

                        _,-%/%|                  

                    _,-'    \//%\                

                _,-'        \%/|%                

              / / )    __,--  /%\                

              \__/_,-'%(%  ;  %)%                

                      %\%,   %\                  

                        '--%'                    

                                                 

                                                 .



                                                 

                        _,-%/%|                  

                    _,-'    \//%\                

                _,-'        \%/|%                

              / / )    __,--  /%\                

              \__/_,-'%(%  ;  %)%                

                      %\%,   %\                  

                        '--%'                    

                                                 

                                                 .



                                                 

                        _,-%/%|                  

                    _,-'    \//%\                

                _,-'        \%/|%                

              / / )    __,--  /%\                

              \__/_,-'%(%  ;  %)%                

                      %\%,   %\                  

                        '--%'                    

                                                 

                                                 .



                                                 

                        _,-%/%|                  

                    _,-'    \//%\                

                _,-'        \%/|%                

              / / )    __,--  /%\                

              \__/_,-'%(%  ;  %)%                

                      %\%,   %\                  

                        '--%'                    

                                                 

                                                 .



                                                 

                        _,-%/%|                  

                    _,-'    \//%\                

                _,-'        \%/|%                

              / / )    __,--  /%\                

              \__/_,-'%(%  ;  %)%                

                      %\%,   %\                  

                        '--%'                    

                                                 

                                                 .



                                                 

                        _,-%/%|                  

                    _,-'    \//%\                

                _,-'        \%/|%                

              / / )    __,--  /%\                

              \__/_,-'%(%  ;  %)%                

                      %\%,   %\                  

                        '--%'                    

                                                 

                                                 .



                                                 

                        _,-%/%|                  

                    _,-'    \//%\                

                _,-'        \%/|%                

              / / )    __,--  /%\                

              \__/_,-'%(%  ;  %)%                

                      %\%,   %\                  

                        '--%'                    

                                                 

                                                 .

Name: Anonymous 2011-06-16 7:27

ITT: niggers and black people

Name: sigs 2011-06-16 7:39

>>180

Parse error: missing the matching [

Name: Anonymous 2011-06-16 7:43

>>227
are you actually that stupid?

Name: Anonymous 2011-06-16 7:48

./sleepsort.sh `seq -s' ' 1 1500` 1
1
2
3
4
5
6
7
8
9
1 // <--- Ooooops
10
11
12

Name: Anonymous 2011-06-16 7:55

$ ./sleepsort.sh 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
./sleepsort.sh: fork: Resource temporarily unavailable
./sleepsort.sh: fork: Resource temporarily unavailable
./sleepsort.sh: fork: Resource temporarily unavailable
./sleepsort.sh: fork: Resource temporarily unavailable
$ 1 <- yup it returned to shell here
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1

Name: Anonymous 2011-06-16 8:01

oh shii

Name: Xeni Jardin 2011-06-16 8:50

Kudos guise!!! I don't quite understand the details of this program, but I like the name. Will blog it. DESUDESUDESU Oh and I can't believe I'm on 4chan for 2 whole years and never heard of text boards before! PUDDI PUDDI!

Name: Aijoona 2011-06-16 8:51

// Javascript

function lazySort(list, callback) {
    var result = [];

    list.forEach(function(i) {
      setTimeout(function() {
      result.push(i);

      if(result.length == list.length) {
      callback(result);
      }
      }, i);
    });
}

lazySort([4,5,7,1,2,4,5], alert);

Name: Anonymous 2011-06-16 9:07

Great, now Randall is going to make a shitty comic about this.

Name: Anonymous 2011-06-16 9:12

RIP Sleepsort thread.
2011/01/20 - 2011/06/16

Name: Anonymous 2011-06-16 9:18

What the fuck, /prog/.
http://codegolf.stackexchange.com/questions/2722/implement-sleep-sort

Name: Anonymous 2011-06-16 9:18

>>234
I hope he does. I find his comics hilarious.

Name: Anonymous 2011-06-16 9:19

<--check'em dubs

Name: Anonymous 2011-06-16 9:20

>>236
Incidentally, what makes this algorithm really interesting is that there actually exist real-life applications. For instance, DNA sequencing (Sanger sequencing) depends on something like this to sort DNA fragments according to their length (and more generally, every electrophoresis does something similar). The difference is that sequencing is performed physically, not in a computer.

It's biotechnology!

Name: Anonymous 2011-06-16 9:22

>>236
Great, and soon a wikipedia page...

Name: AnonyCat 2011-06-16 9:23

Lazy short

#The most lazy way to short
.
.
.
echo "just watching this blog & copy"

Name: Anonymous 2011-06-16 9:26

>>237
Then you don't belong here ``faggot''. Please leave.

Name: Anonymous 2011-06-16 9:28

>>242
No, Randall, you're the outsiders.

Name: Anonymous 2011-06-16 9:39

　　　　　　　　　　　　　　∧＿∧
　　　　　　　　　　　　　（　　　　）
────-㎜────／　　　＼────────
　　　　　　＼＼　　　／／＼　　　＼
..　　　　　　　＼＼／／　　　＼　　　＼
　　　　　　　　　＼／　　　　　　）　∴）ヾ）
　　　　　　　　　　　　　　　　　　/　 / ⌒ヽ
　　　　　　　　　　　　　　　　　 /　 /| | 　　|←>>Reddit
　　　　　　　　　　　　　　　　 /　/ .∪ / ﾉ
　　　　　　　　　　　　　　　　 /　/　. | ｜|
　　　　　　　　　　　　　　　　（ ´|　　 ∪∪
　　　　　　　　　　　　　　　　|　|　　　|　|
　　　　　　　　　　　　　　　　 |　|　　　|　|
　　　　　　　　　　　　　　　　 |　|　　　|　|
　　　　　　　　　　　　　　　　 |　|　　　|　|
　　　　　　　　　　　　　　　(´　ノ　 (´　ノ

Name: Anonymous 2011-06-16 9:42

　　　　　　　　　　　　/◎))）
　　　　　　　　　　　　/　/　：
　　　　　　　　　　　 /　/　　：
　　　　　　　　　　　/　/　　　：
　　　 /prog/　　 /　/　　　　：,
　　　　　　　　　　/　/　　　　　：,
　　　　　人　　　/　/　　　　　　　：,
　　　　（＿_）　/　/　　　　　　　　：,
　　　 .（＿＿） /　/　　　　　　　　　　：,
　　　.（,,・∀・）　 /　　　　　　　　､　.人
　　　|/　つ¶＿_/　　　　ヽヽ　　　　（＿_）　　ｶﾞｯ! >>Reddit
　　　L　ヽ／.　|　　　　　ヽ　ニ三 .（＿＿）　..人∧__,∧∩
　　　＿∪ |＿__|　　　　　　　　　 .（＿＿＿）<　 >｀Д´）./
　　 [＿＿＿＿]＿　　　　　　　　　　　　　　　 .V/　　　 /
　/＿＿＿＿＿_ヽ_ヽ　　　　　　　　　　　　　 /　 /　./
　|＿＿＿＿＿＿|＿|　　　　　　　　　　　　　（＿_,）＿）
/◎｡◎｡◎｡◎ヽ= /￣/
ヽ_◎_◎_◎_◎ﾉ=ﾉヽニヽ

Name: Anonymous 2011-06-16 9:53

>>236
Sleep Sort is an integer sorting algorithm I found on the Internet.
He didn't even give OP credit. But that's probably for the best seeing how dumb the reddit posters in this thread are.

Name: Bill 2011-06-16 9:59

I hate to rain on every ones parade, but this algorithm is only low order if you ignore kernel scheduling efficiencies. As you add more processes the kernel will have to do more work to correctly order the invocations. I do not know what the typical scheduler efficiency is, but I would not be surprised if it is O(n^2) or worse.

Name: Anonymous 2011-06-16 9:59

>>247
SCHEDULE MY ANUS

Name: Anonymous 2011-06-16 10:04

>>247
Thank you for pointing out what >>133-kun explained a month ago, Bill.

Name: Anonymous 2011-06-16 10:15

Can we please forget about this shit and leave the sepplessort to the reddit nigger fags?

Name: Anonymous 2011-06-16 10:23

>>250
What about intellectual property? We should sue them.

Name: Anonymous 2011-06-16 10:57

>>251
/prog/ is gonna be richer than any nigger eveer imagined possible

Name: Anonymous 2011-06-16 11:05

I still refuse to believe that any reddit users have actually poasted here.

Name: You 2011-06-16 11:11

Name: Anonymous 2011-06-16 11:13

>>253
poasted
G! T! F! O!

Name: Anonymous 2011-06-16 11:22

>>253 Hi, I'm from reddit! I hear this site is a great place to get my programming questions answered?

Name: Anonymous 2011-06-16 11:23

^fail

Name: RedCream 2011-06-16 11:24

>>255
Do not defy the Cream lest you end up on the receiving end of the goatfinger.

Name: Anonymous 2011-06-16 11:25

It's not a sorting algorithm until this guy's done it.

http://www.youtube.com/watch?v=ROalU379l3U&feature=related

Name: Anonymous 2011-06-16 12:32

pretty fucking cool

Name: Anonymous 2011-06-16 12:35

Anyways, >>260, please listen to me. That it's really related to this thread.
I went to Yoshinoya a while ago; you know, Yoshinoya?
Well anyways there was an insane number of people there, and I couldn't get in.
Then, I looked at the banner hanging from the ceiling, and it had "150 yen off" written on it.
Oh, the stupidity. Those idiots.
You, don't come to Yoshinoya just because it's 150 yen off, fool.
It's only 150 yen, 1-5-0 YEN for crying out loud.
There're even entire families here. Family of 4, all out for some Yoshinoya, huh? How fucking nice.
"Alright, daddy's gonna order the extra-large." God I can't bear to watch.
You people, I'll give you 150 yen if you get out of those seats.
Yosinoya should be a bloody place.
That tense atmosphere, where two guys on opposite sides of the U-shaped table can start a fight at any time,
the stab-or-be-stabbed mentality, that's what's great about this place.
Women and children should screw off and stay home.
Anyways, I was about to start eating, and then the bastard beside me goes "extra-large, with extra sauce."
Who in the world orders extra sauce nowadays, you moron?
I want to ask him, "do you REALLY want to eat it with extra sauce?"
I want to interrogate him. I want to interrogate him for roughly an hour.
Are you sure you don't just want to try saying "extra sauce"?
Coming from a Yoshinoya veteran such as myself, the latest trend among us vets is this, extra green onion.
That's right, extra green onion. This is the vet's way of eating.
Extra green onion means more green onion than sauce. But on the other hand the price is a tad higher. This is the key.
And then, it's delicious. This is unbeatable.
However, if you order this then there is danger that you'll be marked by the employees from next time on; it's a double-edged sword.
I can't recommend it to amateurs.
What this all really means, though, is that you, >>260-kun, should just stick with today's special.

Name: James Herring 2011-06-16 12:39

Here's my more efficient rendition of the OP's code: http://bit.ly/97Q3tx

Name: Anonymous 2011-06-16 13:36

Why would you want to wait for 2,000 milliseconds just to sort this array: [2000 1]

Name: Anonymous 2011-06-16 14:01

>>263
THE SAME OBSERVATION WAS MADE IN THE FIRST REPLY, OVER 5 MONTHS AGO. PLEASE GO BACK TO REDDIT!

Name: Anonymous 2011-06-16 14:04

hbk

Name: Anonymous 2011-06-16 14:09

>>264
* HAS BEEN MADE

Name: Anonymous 2011-06-16 14:14

>>262
Stop - there might be a problem with the requested link

Name: Oliv 2011-06-16 14:20

>>4
In terms of operations, the complexity is always O(n), even in average and worse cases. That's something no other algorithm can do according to http://en.wikipedia.org/wiki/Sorting_algorithm#Comparison_of_algorithms

Name: Anonymous 2011-06-16 14:31

Thanks, Oliv.

Name: Anonymous 2011-06-16 14:45

>>267
troll

Name: Anonymous 2011-06-16 15:22

>>268
O(my^anus)

Name: Anonymous 2011-06-16 15:29

Java-Fag posts java-impl:

import java.util.ArrayList;

public class Main extends Thread{
    Long toSleep;
    ArrayList<Long> solution;

    public static void main(String[] args){
      ArrayList<Long> solution = new ArrayList<Long>();
      ArrayList<Thread> solverThreads = new ArrayList<Thread>();

      for(String val: args){
      Long valNum = Long.parseLong(val);
      Thread solverThread = new Main(valNum, solution);

      solverThread.start();
      solverThreads.add(solverThread);
      }

      for(Thread solverThread: solverThreads){
      try {
      solverThread.join();
      } catch (InterruptedException e) {
      // gtfo
      }
      }

      System.out.println(solution.toString());
    }

    public Main(Long toSleep, ArrayList<Long> solution){
      this.toSleep = toSleep;
      this.solution = solution;
    }

    public void run(){
      try {
      Thread.sleep(toSleep*1000);
      } catch (InterruptedException e) {
      // gtfo
      }

      solution.add(toSleep);
    }
}

Name: Anonymous 2011-06-16 16:00

>>262
i had to click though two consecutive malware warnings to se a parrot on a dick. the attempts to harm my pc are cute, but futile. (java? srsly?)

Name: Anonymous 2011-06-16 16:31

>>273
back to reddit please

Name: Anonymous 2011-06-16 17:14

where the fuck is all the python code?

all of these other shitty languages are getting attention and the only good one isn't

Name: Anonymous 2011-06-16 17:54

>>275
See >>274

Name: yiihsia 2011-06-17 1:14

haha,java:

public class SleepSort {
    public static void main(String[] args) {
      int[] ints = {1,4,7,3,8,9,2,6,5};
      SortThread[] sortThreads = new SortThread[ints.length];
      for (int i = 0; i < sortThreads.length; i++) {
      sortThreads[i] = new SortThread(ints[i]);
      }
      for (int i = 0; i < sortThreads.length; i++) {
      sortThreads[i].start();
      }
    }
}
class SortThread extends Thread{
    int ms = 0;
    public SortThread(int ms){
      this.ms = ms;
    }
    public void run(){
      try {
      sleep(ms*10+10);
      } catch (InterruptedException e) {
      // TODO Auto-generated catch block
      e.printStackTrace();
      }
      System.out.println(ms);
    }
}

Name: Anonymous 2011-06-17 2:32

>>276
See >>279.

Name: Anonymous 2011-06-17 2:32

back to /b/

Name: Anonymous 2011-06-17 3:41

>>275
That's because your community is a bunch of cocksuckers who do nothing but praising python and bashing everything else.

Name: eddyb 2011-06-17 3:46

c'mon. can't someone clean this thread? lame, I like sleepsort, but now it's full of fags.

Name: Anonymous 2011-06-17 4:00

At first I was like :0 but then I was like I dont even...so now I am convinced that you guys have invented a time machine

Name: Alfe 2011-06-17 5:28

Shortest versions? The Ruby oneliner was nice already, but I think bash can be even smaller:

Ruby:
ARGV.each { |e| fork { sleep(e.to_f/1000); puts e } }

Bash:
for n; do { sleep $n; echo $n; } & done

(usage:
$ f() { echo $(for n; do { sleep $n; echo $n; } & done); }
$ f 3 2 1
1
2
3
$
)

Name: Anonymous 2011-06-17 5:42

This is a hoot. Impressive, genius.

===Multi-threaded Perl version===
#! /usr/bin/perl -w

use strict;
use threads;

my ($i, @thrs) = (0);

foreach (@ARGV) {$thrs[$i++] = threads->create(\&sorter, $_)}
$i = 0;
foreach (@ARGV) {$thrs[$i++]->join()}

sub sorter {sleep($_[0]); print $_[0], "\n"}
===End of Sleep Sort===

If one uses Time::HiRes, one could sleep for sub-second times.

Name: Java Suit 2011-06-17 6:31

JAVA

Name: spacebat 2011-06-17 6:46

perl -E 'fork || do { sleep $_, say, exit } for @ARGV; until (wait<0) {}' 5 2 7 4 1

Name: Anonymous 2011-06-17 8:40

Lua POSIX version:

require ('posix')

function sleep (n)
   os.execute ('sleep ' .. n)
end

function sleepsort (arr)
   for i = 1, #arr do
      pid = posix.fork ()
      if pid == 0 then
   -- posix.sleep does not work with float
   sleep (arr[i] / 10)
   print (arr[i])
   return
      end
   end
end

sleepsort (arg)

Name: Anonymous 2011-06-17 8:45

No one is posting code.

Name: lolex 2011-06-17 8:57

posting on EPIC thread

Name: druud 2011-06-17 9:27

perl -wle 'fork&&print(sleep$_)&&exit for@ARGV' 6 3 4 2 1 5 7

Name: druud 2011-06-17 9:33

And for purists:
perl -wle 'fork||print(sleep$_)&&exit for@ARGV;1while-1!=wait' 6 3 4 2 1 5 7

Name: Anonymous 2011-06-17 9:47

Jeepers, you could at least use [code] tags, silly redditors.

Name: Anonymous 2011-06-17 9:48

>>292
AND YOU SHOULD CHECK THE FUCKING SAGE BOX ASSHOLE

Name: druud 2011-06-17 9:54

perl -wle'fork||(sleep$_,print,exit)for@ARGV' 6 3 4 7 2 1 5

Name: Anonymous 2011-06-17 10:05

<- check'em dubs

Name: Anonymous 2011-06-17 10:10

>>293
you can check my box

Name: Anonymous 2011-06-17 10:24

>>293
Stop being an autist.

Name: lbolla 2011-06-17 10:44

and a LISP implementation (SBCL only):

(use-package :sb-thread)

(defun show (item)
(sleep item)
(format t "~A~%" item))

(defun sleep-sort (lst)
(mapcar
#'(lambda (item) (make-thread #'(lambda () (show item))))
lst))

Name: Anonymous 2011-06-17 10:45

>>298
mapcar
for side effects? Get out.

Name: Anonymous 2011-06-17 11:04

>>299
my other mapcar is a mdpcdr

Name: Anonymous 2011-06-17 13:20

????????????????????????????/

Name: Anonymous 2011-06-17 13:37

Please use code tag when posting code to this forum!

Name: Anonymous 2011-06-17 13:43

>>302
fuck you fag

Name: Anonymous 2011-06-17 13:44

Please code post tag when coding use to this forum!

Name: Anonymous 2011-06-17 14:02

sleep sort in Objective-C using blocks:



@interface NSArray (SleepSort)

- (void)sleepSortObjectsUsingBlock:(void (^)(id obj))block;

@end



@implementation NSArray (SleepSort)



- (void)sleepSortObjectsUsingBlock:(void (^)(id obj))block

{

    for (id obj in self) {

        NSDictionary *info = [NSDictionary dictionaryWithObjectsAndKeys:obj, @"obj", block, @"block", nil];

        [self performSelector:@selector(_handleSleepSortItemWithInfo:) withObject:info afterDelay:[obj intValue]];

    }

}



- (void)_handleSleepSortItemWithInfo:(NSDictionary *)info

{

    id obj = [info objectForKey:@"obj"];

    void (^block)(id obj) = [info objectForKey:@"block"];

    block(obj);

}



@end

To use:



    NSArray *items = [NSArray arrayWithObjects:

        [NSNumber numberWithInt:5],

        [NSNumber numberWithInt:3],

        [NSNumber numberWithInt:6],

        [NSNumber numberWithInt:3],

        [NSNumber numberWithInt:6],

        [NSNumber numberWithInt:3],

        [NSNumber numberWithInt:1],

        [NSNumber numberWithInt:4],

        [NSNumber numberWithInt:7],

        nil];

    

    [items sleepSortObjectsUsingBlock:^(id obj) { NSLog(@"obj = %@", obj); }];

Name: Anonymous 2011-06-17 14:10

SPREAD THE FAIL WHALE

▄██████████████▄▐█▄▄▄▄█▌
██████▌▄▌▄▐▐▌███▌▀▀██▀▀
████▄█▌▄▌▄▐▐▌▀███▄▄█▌
▄▄▄▄▄██████████████▀

Name: Anonymous 2011-06-17 15:03

>>133
^Jesus _Christ, don't they teach anything to kids these days‽

Sepples doesn't have type inference – why did you put that i + 1 in there? That turns the whole functor into a monomorphism (instead of the usual polymorphism which you undoubtedly have heard about when learning Sepples). Good luck with referential transparency now.
Why do you pass smallest as a reference? 1..n relations are terrible! practice.
Why the fixed loop iterations? Do you want to subject your code to a stack pointer monadic overflow?
You should rewrite your code after getting acquainted with the Sussman protocol, as defined in RFC (``Request for Cudders'') 6001.

Name: Anonymous 2011-06-17 15:58

>>307
Hi, http://dis.4chan.org/read/prog/1294909754/15.

Name: Anonymous 2011-06-17 18:09

JESUS FUCKING CHRIST
USE CODE TAGS, YOU STUPID FUCKERS
I DON'T CARE ABOUT THIS SHIT ANYMORE
/prog/RIDERS, YOU CAN CALL ME OFF TO /b/
BECAUSE YEAH
I MAD
FUCKING REDDIT SCUM

USE
MOTHERFUCKING
CODE
TAGS
YOU
DUMB
RETARDS

Name: Anonymous 2011-06-17 18:58

>>309
You can stay.

Name: Anonymous 2011-06-17 19:32

<-- check em dubz

Name: Anonymous 2011-06-17 20:38

I didn't bother to read the thread but this shit is O(1) obviously.

OP your Turing Award is in the mail.

Name: Anonymous 2011-06-18 21:56

>>312
this shit is O(1) obviously.
You're thinking RPCsort.

Name: Anonymous 2011-06-19 5:40

>>311
nice dubz bro

Name: Anonymous 2011-06-19 6:29

Nice thread, bros.

Name: ADS the new Autism 2011-06-19 8:35

le discusion (yes im offten at reddit and its way better than prog ever was)

Name: Lulz 2011-06-19 14:20

Algorithms of this type are quite normal in the hacking world. You guys need some more lulz gun powder it seems . I see more script kiddies here

Name: Anonymous 2011-06-19 17:35

>>317
U JELLY

Name: Anonymous 2011-06-20 3:04

Oh no, I didn't know this link would bring me to where all these 4chan weirdos hang out.

Note to the haters: Reddit rocks!

:)

Name: 2011-06-20 3:13

Note from the rockers: Reddit haters!

Name: Anonymous 2011-06-20 6:21

>>319 notsureiftrolling.jpg

Name: Anonymous 2011-06-20 14:43

Ok, I've been thinking about this sleep sort thing for a few days now. Thanks OP for nerd-sniping me. First off, the command `usleep` should be used in place of `sleep` for a significant speedup. But along this same vein, what we really want is to get to the granularity of the number of clock cycles it takes to print a number. Furthermore, if we alter this for a real-time scheduler, then we can just schedule each print with a priority of i times a constant (the amount of time it would take to print i). The scary part is that this would run in O(n) time -- which is supposed to be impossible.

Name: Anonymous 2011-06-20 14:58

i still dont get for what u should use that thing

Name: Anonymous 2011-06-20 15:03

sleepsort is a variation on loopsort which is O(n)

You first find the minimum and maximum O(n)

make a bitfield with size [maximum - minimum] O(1)

Loop through the input array again, setting a bit to 1 at [iterator - minimum] O(n)

Loop through the bitfield and push the value (iterator + minimum) on a stack. O(n)

O(n) + O(n) + O(n) + O(1) = O(n)

Name: Anonymous 2011-06-20 15:11

But isn't it a counting sort?

Name: Anonymous 2011-06-20 15:33

[code]#!/usr/bin/python2
import sys, time, threading

def ss(i):
    time.sleep(int(i))
    print i

for i in sys.argv[1:]:
    threading.Thread(target=ss, args=i).start()

Name: Anonymous 2011-06-20 16:15

>>326
reddit children, behave!

Name: Anonymous 2011-06-21 7:58

Keep, Because you editors keep behaving as nazis. I am a German citizen and when I was a young boy watched books being burned. You delete article of programming language because they are "not notable". By your definition, "Puff Daddy" are "not notable" to me. I should propose to delete their article. There is nothing wrong with information. You are nazis. To hell with you. 79.169.56.225 (talk) 11:58, 21 June 2011 (UTC)

Name: Anonymous 2011-06-21 8:59

>>328
VIPPER detected

Name: Anonymous 2011-06-21 13:48

Hey guys, It isn't any linear or quadratic time algorithm. Its an exponential time algorithm - "The worst" we can say in sorting algorithms. However the sleep thing is fantastic as CPU can perform another operations interim.

Name: Anonymous 2011-06-21 15:16

>>330
Hey guys, It isn't any linear or quadratic time algorithm. Its an exponential time algorithm

The one implementation can run in linear time. Now shut the fuck up and let the little jewish girls show us what they know.

Name: Anonymous 2011-06-21 15:25

<-- check em dubz

Name: Anonymous 2011-06-21 15:26

>>332
nice

Name: Anonymous 2011-06-21 17:21

OP here. Did someone submit this to reddit, or did they jsust randomly pick it up? This has gone full lulz - especially the wikipedia afd discussion...also been googling, loads of blogs and stuff fapping over it - google translate is my friend for reading all the jap/chinny blogs

Name: Anonymous 2011-06-21 19:47

>>334
OP here.
Will save to disbelieve…success!

gone full lulz
We had a funny joke. A bunch of idiots who hadn't heard a joke in 10 years eventually ran into it. Now we have a funny joke and a bunch of idiots.

Name: Anonymous 2011-06-21 20:04

>>334
Wait, WAIT. It's on wikipedia too? Goddamn.

Name: Anonymous 2011-06-21 20:12

>>336
What did you expect?

Name: Anonymous 2011-06-21 22:56

It's on #scheme too.

<klutometis> cky: It turns out the pjb was actually talking about sleep-sort: <http://dis.4chan.org/read/prog/1295544154>;.

Name: Anonymous 2011-06-22 5:28

http://en.wikipedia.org/wiki/Sleep_sort
Although its origins are unclear, an internet forum thread from 2011 by an anonymous programmer is believed to be the earliest known reference to the algorithm.

Also this thread is an ``unreliable source''.

Name: Anonymous 2011-06-22 5:59

We Wikipedia now!

Name: Anonymous 2011-06-22 8:46

>>340

No, I'm Wikipedia!

Name: Anonymous 2011-06-22 8:53

requesting a picture of the sussman being peed on to undermine this site as a soruce

Name: Anonymous 2011-06-22 9:08

http://hackerne.ws/item?id=2657942
The mailto:sage links in some of the posts are essentially public downvotes; from the Japanese "下げ", meaning "down", and pronounced "sah ge".
Incorrect, sbierwagen.

Name: Anonymous 2011-06-22 9:26

>>343
DOWNVOTED! SAGE!

Name: Anonymous 2011-06-22 9:31

>>344
Downvoted.

Name: Anonymous 2011-06-22 9:38

<-- check em dubz

Name: Anonymous 2011-06-22 9:40

>>346
Good job.

Name: Anonymous 2011-06-22 9:47

Sageru in the Japanese language is the dictionary form of to lower. The case of applying sage to the email field will mean that the thread is not bumped to the top of the thread list, the thread position is maintained as opposed to the standard behaviour when the thread position is normally bumped to the top of the list.

Name: Anonymous 2011-06-22 10:01

>>348
Downvoteru.

Name: Anonymous 2011-06-22 10:26

>>348

upboat

Name: Anonymous 2011-06-22 11:02

DEY TURK ERRR DUBZ!!!!

Name: Anonymous 2011-06-22 16:54

I consider myself conversant with 4chan, and I had no idea that the dis subdomain existed.
I always wondered if there was a chan for hackers...now I realize there is. And oh boy, what a chan it is.
Boy is he in for a surprise when he finds out /prog/ is just a bunch of autistic undergrads with a hard-on for functional programming.

Name: Anonymous 2011-06-22 17:50

>>352
speak for yourself machumbo... i work as a developer and only use imperative languages

Name: Anonymous 2011-06-22 17:55

GTFO

Name: Anonymous 2011-06-22 18:40

>>352

You never realized the whole read SICP thing was just a joke?
Wow, you must be pretty stupid.

Name: Anonymous 2011-06-22 18:44

>>355

You never realized the whole ``You never realized the whole read SICP thing was just a joke? Wow, you must be pretty stupid.'' thing was just a joke?
Wow, you must be pretty stupid.

Name: Anonymous 2011-06-22 19:04

>>356

You never realized the whole ``You never realized the whole ``You never realized the whole read SICP thing was just a joke? Wow, you must be pretty stupid.'' thing was just a joke? Wow, you must be pretty stupid.'' thing was just a joke?
Wow, you must be pretty stupid.

Name: Anonymous 2011-06-22 19:54

>>356,357

You're not funny, please go back to /g/ or wherever you came from.

Name: Anonymous 2011-06-22 20:00

>>355-357
[m]Back to /prog/, please.[m]

Name: Anonymous 2011-06-22 20:02

>>359
Ah, fuck, messed up.

>>355-357
Back to /prog/, please.

Name: Anonymous 2011-06-23 3:27

>>355
SICP is no joke. SICP is THE text to computer wizardry and is worthy of being the seminal text for novices with an interest in wizardry.

Name: Anonymous 2011-06-23 4:12

>>361

Haha, you're funny.

Name: Anonymous 2011-06-23 4:20

>>355
How dare you badmouth SICP.

Name: Anonymous 2011-06-23 4:42

пишу в эпичнос треде!

Name: Anonymous 2011-06-23 5:13

>>364
эпичнос
Дурак, по клавишам попадать научись сначала, потом в эпичные нити писать будешь.

Name: Anonymous 2011-06-23 6:12

>>363
The same way I dare to badmouth Lisp, which is a faggot's preferred language.

Name: Anonymous 2011-06-23 6:57

>>364
>>365
хуй

Name: Anonymous 2011-06-23 7:00

xynta.

Name: >>355 2011-06-23 13:07

>>366
You are not me.

You should sage, and you shouldn't use ``faggot''.

Name: Anonymous 2011-06-23 13:39

I am the real >>355
>>366 and >>369 are ``faggots''

Name: Anonymous 2011-06-23 13:40

<-- dubz, check em

Name: Anonymous 2011-06-23 14:18

^{SMOKE SAGE EVERYDAY}^!

Name: Anonymous 2011-06-23 14:45

Well there's no way this thread is a ``reliable resource' to Wikipedia now.

Name: Anonymous 2011-06-23 14:53

Name: Anonymous 2011-06-23 15:27

^{That's Subpar}!

Name: Anonymous 2011-06-23 17:59

>>1
they called you an idiot on wikipedia.

RAID TIME

Name: Anonymous 2011-06-23 19:09

>>376
Lol someone on wikipedia calling someone else an idiot. The ironing is delicious

Name: >>355 2011-06-23 19:31

>>370
No you're not, stop lying, it serves no purpose.

Name: Anonymous 2011-06-24 0:30

>>378
Stop being stupid, why would you want to be me anyway?

Name: Anonymous 2011-06-24 1:06

http://en.wikipedia.org/wiki/Wikipedia:Articles_for_deletion/Sleep_sort

Those ``in need of citations'' retards make /prog/ looks like some English gentlemen's club. Seriously, who are the trolls?

Name: Anonymous 2011-06-24 2:51

>>380

Thank you Erik.lonroth

About Wikipedia...

Dudes are voting for deletion simply because:
1 - it became [sort of] a meme [calling everyone in this thread idiots];
2 - no “reputable” sources came for discussion [calling everyone envolved ignorant].

Additional [ignorant] thoughts...

In fact, if you swap the sleep(t) with a function insert(n) that puts n in the n^th position of a shared array, ~4bi years goes off, leaving time and space complexity at O(max(vector)).

Plus, with min-priority queues we can do a cooperative threading model, replacing sleep(time) with delay(priority), and possibly achieving a better complexity than O(n log n) in strict scenarios (fusion/vEB trees).
In other words, schedule with a [not trivial] priority queue and you're done.

>>322 I'm still trying to figure it out.

Name: Anonymous 2011-06-24 8:24

Wikipedia is more autistic than /prog/ it seems.

Name: Anonymous 2011-06-24 8:37

>>382
My view is that those that frequent anonymous boards, are in a temporary autism state common to nerdy young men. They realize that wasting time on the internet is a sad deviation resulting from their immaturity and inability to interact in an emotionally-mature outgoing manner. Therefore the desire for a fixed username and a status that goes with that username is not important as it is already known to be insignificant once they can move on to the real world.
Those that frequent forums and sites involving usernames and a gradual increase in perceived status based on efforts put into that site are the true autists. This is all they have. They have no potential for success in the real world. They have no life, and no potential for life.

Name: Anonymous 2011-06-24 9:07

http://gafter.blogspot.com/2006/11/linear-time-sort-puzzler.html
Is this the first occurence of this "Sleepsort" meme?

Name: Anonymous 2011-06-24 9:09

>>383
Oh fuck you, there's nobody more autistic than me.

Name: Anonymous 2011-06-24 9:10

>>384
It's not a meme, fagfucker.

Name: Anonymous 2011-06-24 10:00

THIS IS A MESSAGE FROM THE SUSSIX DEV TEAM (ME)

We're a bit offended that they left out our implementation from the Wikipedia article, obviously any piece of SUSSIX software is perfect per definition and should therefore be included, it would make the article a piece of post-modern art.

THIS HAS BEEN A MESSAGE FROM THE SUSSIX DEV TEAM (ME)

Name: Anonymous 2011-06-24 14:42

>>383
Interesting findings.

Name: Anonymous 2011-06-24 15:01

>>387
link?

Name: Anonymous 2011-06-24 15:04

>>387
link?

Name: Anonymous 2011-06-24 15:04

>>387
link?

Name: Anonymous 2011-06-24 15:06

bump

[Chorus]
We gon rumble in this ho
We gon rumble in this ho
All you weak ass niggas get yo ass off the floor
We gon rumble in this ho
We gon rumble in this ho
All you chicken head hoes get yo ass off the floor

[Verse One]
Yeah nigga, yeah nigga
I got gold teeth nigga
I'm from the street nigga
You got some beef nigga
Yeah nigga, yeah nigga
We keep the dope cookin
And where I'm from grown men don't take no ass whoopins
Yeah nigga, yeah nigga
Go get yo boys nigga
I bring the noise nigga
So bring your toys nigga
Yeah nigga, yeah nigga
You got your drama boy
Or marijuana boy
I'll shoot your mama boy
Yeah nigga, yeah nigga
You got your nuts huh
You went to jail and I saw you was a weak punk
Yeah nigga, yeah nigga
I know your story nigga
Your history, off of me you gets no glory nigga
Yeah nigga, yeah nigga
So you a dope nigga
But you so thin look like that you do the coke nigga
Yeah nigga, yeah nigga
Think you is a pistol playa
Come in my face and I'll kill you like a dragon slayer

[Chorus]
We gon rumble in this ho
We gon rumble in this ho
All you bad weed sellers get yo ass off the floor
We gon rumble in this ho
We gon rumble in this ho
All you sorry ass niggas get yo ass off the floor
We gon rumble in this ho
We gon rumble in this ho
All you West Haven niggas get yo ass off the floor
We gon rumble in this ho
We gon rumble in this ho
All you duck ass bitches get yo ass off the floor

[Verse Two]
Yeah nigga, yeah nigga
I'm 'bout this 'caine nigga
I'm stayin true to these words that I slang nigga
Yeah nigga, yeah nigga
That Ghetty Green nigga
See I was put on this Earth for hustling nigga
Yeah nigga, yeah nigga
But when I have to

I put that Glock in my hand and pull a jack move
Yeah nigga, yeah nigga
Daily routine nigga
Down wit my dawgs and we out for this Cream nigga
Yeah nigga, yeah nigga
You got a young ho
I shoot a nigga in his face and slap a dumb ho
Yeah nigga, yeah nigga
Yo ho stay squakin
She need to shut the fuck up, grown folk talkin
Yeah nigga, yeah nigga
But she a star nigga
She ate my dick then I kicked her out my car nigga
Yeah nigga, yeah nigga
I'm smokin leaves nigga
To calm me down, to put my mind man at ease nigga

[Chorus]
We gon rumble in this ho
We gon rumble in this ho
All you fuckin cock hoes get yo ass off the floor
We gon rumble in this ho
We gon rumble in this ho
All you add water killers get yo ass off the floor
We gon rumble in this ho
We gon rumble in this ho
All you punk ass niggas get yo ass off the floor
We gon rumble in this ho
We gon rumble in this ho
All you fake ass hoes get yo ass off the floor

[Verse Three]
Yeah nigga, yeah nigga
I lay the smack down
Done been through hoods where you better watch yo back now
Cause nigga, laws nigga
The code we live by
Don't wait for later, do it now, boy it's do or die
I nigga, be's nigga
I'm for my cheese nigga
I got my infra-beams watchin you, please nigga
Bank nigga, rank nigga
It make ya thank nigga
Stay on the ground so ya ship won't sank nigga
Rocks nigga, crack nigga
I'm stackin wealth nigga
But it aint me cause the dope sell itself nigga
Who nigga, you nigga
You wanna try Pat
What you gon' get is yo motherfuckin skull cracked
Hurt nigga, pain nigga
Is what you feel nigga
The slugs talk through the barrel of the steel nigga
So nigga, roll nigga
That's wit this click bitch
Or get yo trick ass wacked wit da quickness

Name: Anonymous 2011-06-24 15:09

<-- loads of dubz, check em

Name: Anonymous 2011-06-24 15:51

Name: Anonymous 2011-06-24 16:05

>>394
This webpage has asked to redirect to http://lmgtfy.com/?q=dog+cum
Allow Deny

*clicks deny

Name: Anonymous 2011-06-24 16:47

>>395
Did you check all of them?

Name: Anonymous 2011-06-24 16:49

I'm imagining a researcher reading about the sleep sort on wikipedia and following the link here and reading this thread.

Name: Anonymous 2011-06-24 16:53

>>397
if ya aint gonna shake dont pretend to sage

Name: Anonymous 2011-06-24 17:02

<-- watch my dubz

Name: Anonymous 2011-06-24 17:12

mine are better because the number is also divisible by 100, 25 and 4
ah the harmony

Name: Anonymous 2011-06-24 17:19

>>400
Your dubz are not even ``notable'' according to Wikipedia.

Name: Anonymous 2011-06-24 17:20

Gentlemen, we are approaching the fateful 404. That is where the thread must end. Two last posts. Make good use of them.

Name: sage 2011-06-24 17:21

sage

Name: sage!sage 2011-06-24 17:22

sage

Name: Anonymous 2011-06-24 18:20

>>389-391
See >>81

Name: Anonymous 2011-06-24 19:03

^{[citation needed]}

Name: Anonymous 2011-06-24 19:03

^{[citation needed]}

Name: Anonymous 2011-06-24 19:03

^{[citation needed]}

Name: Anonymous 2011-06-24 19:03

^{[citation needed]}

Name: Anonymous 2011-06-24 19:03

^{[citation needed]}

Name: Anonymous 2011-06-24 19:03

^{[citation needed]}

Name: Anonymous 2011-06-24 19:03

^{[citation needed]}

Name: Anonymous 2011-06-24 19:03

^{[citation needed]}

Name: Anonymous 2011-06-24 19:03

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:04

^{[citation needed]}

Name: Anonymous 2011-06-24 19:05

^{[citation needed]}

Name: Anonymous 2011-06-24 19:05

^{[citation needed]}

Name: Anonymous 2011-06-24 19:05

^{[citation needed]}

Name: Anonymous 2011-06-24 19:05

^{[citation needed]}

Name: Anonymous 2011-06-24 19:05

^{[citation needed]}

Name: Anonymous 2011-06-24 19:05

^{[citation needed]}

Name: Anonymous 2011-06-24 19:05

^{[citation needed]}

Name: Anonymous 2011-06-24 19:05

^{[citation needed]}

Name: Anonymous 2011-06-24 19:05

^{[citation needed]}

Name: Anonymous 2011-06-24 19:05

^{[citation needed]}

Name: Anonymous 2011-06-24 19:05

^{[citation needed]}

Name: Anonymous 2011-06-24 19:06

^{[citation needed]}

Name: Anonymous 2011-06-24 19:06

^{[citation needed]}

Name: Anonymous 2011-06-24 19:06

^{[citation needed]}

Name: Anonymous 2011-06-24 19:06

^{[citation needed]}

Name: Anonymous 2011-06-24 19:06

^{[citation needed]}

Name: Anonymous 2011-06-24 19:06

^{[citation needed]}

Name: Anonymous 2011-06-24 19:06

^{[citation needed]}

Name: Anonymous 2011-06-24 19:06

^{[citation needed]}

Name: Anonymous 2011-06-24 19:06

^{[citation needed]}

Name: Anonymous 2011-06-24 19:06

^{[citation needed]}

Name: Anonymous 2011-06-24 19:06

^{[citation needed]}

Name: Anonymous 2011-06-24 19:06

^{[citation needed]}

Name: Anonymous 2011-06-24 19:07

^{[citation needed]}

Name: Anonymous 2011-06-24 19:07

^{[citation needed]}

Name: Anonymous 2011-06-24 19:07

^{[citation needed]}

Name: Anonymous 2011-06-24 19:07

^{[citation needed]}

Name: Anonymous 2011-06-24 19:07

^{[citation needed]}

Name: Anonymous 2011-06-24 19:07

^{[citation needed]}

Name: Anonymous 2011-06-24 19:07

^{[citation needed]}

Name: Anonymous 2011-06-24 19:07

^{[citation needed]}

Name: Anonymous 2011-06-24 19:07

^{[citation needed]}

Name: Anonymous 2011-06-24 19:07

^{[citation needed]}

Name: Anonymous 2011-06-24 19:07

^{[citation needed]}

Name: Anonymous 2011-06-24 19:07

^{[citation needed]}

Name: Anonymous 2011-06-24 19:07

^{[citation needed]}

Name: Anonymous 2011-06-24 19:07

^{[citation needed]}

Name: Anonymous 2011-06-24 19:08

^{[citation needed]}

Name: Anonymous 2011-06-24 19:08

^{[citation needed]}

Name: Anonymous 2011-06-24 19:08

^{[citation needed]}

Name: Anonymous 2011-06-24 19:08

^{[citation needed]}

Name: Anonymous 2011-06-24 19:08

^{[citation needed]}

Name: Anonymous 2011-06-24 19:08

^{[citation needed]}

Name: Anonymous 2011-06-24 19:08

^{[citation needed]}

Name: Anonymous 2011-06-24 19:08

^{[citation needed]}

Name: Anonymous 2011-06-24 19:08

^{[citation needed]}

Name: Anonymous 2011-06-24 19:08

^{[citation needed]}

Name: Anonymous 2011-06-24 19:08

^{[citation needed]}

Name: Anonymous 2011-06-24 19:08

^{[citation needed]}

Name: Anonymous 2011-06-24 19:09

^{[citation needed]}

Name: Anonymous 2011-06-24 19:09

^{[citation needed]}

Name: Anonymous 2011-06-24 19:09

^{[citation needed]}

Name: Anonymous 2011-06-24 19:09

^{[citation needed]}

Name: Anonymous 2011-06-24 19:09

^{[citation needed]}

Name: Anonymous 2011-06-24 19:09

^{[citation needed]}

Name: Anonymous 2011-06-24 19:09

^{[citation needed]}

Name: Anonymous 2011-06-24 19:09

^{[citation needed]}

Name: Anonymous 2011-06-24 19:09

^{[citation needed]}

Name: Anonymous 2011-06-24 19:09

^{[citation needed]}

Name: Anonymous 2011-06-24 19:09

^{[citation needed]}

Name: Anonymous 2011-06-24 19:09

^{[citation needed]}

Name: Anonymous 2011-06-24 19:09

^{[citation needed]}

Name: Anonymous 2011-06-24 19:09

^{[citation needed]}

Name: Anonymous 2011-06-24 19:09

^{[citation needed]}

Name: Anonymous 2011-06-24 19:09

^{[citation needed]}

Name: Anonymous 2011-06-24 19:10

^{[citation needed]}

Name: Anonymous 2011-06-24 19:10

^{[citation needed]}

Name: Anonymous 2011-06-24 19:10

^{[citation needed]}

Name: Anonymous 2011-06-24 19:10

^{[citation needed]}

Name: Anonymous 2011-06-24 19:10

^{[citation needed]}

Name: Anonymous 2011-06-24 19:10

^{[citation needed]}

Name: Anonymous 2011-06-24 19:10

^{[citation needed]}

Name: Anonymous 2011-06-24 19:10

^{[citation needed]}

Name: Anonymous 2011-06-24 19:10

^{[citation needed]}

Name: Anonymous 2011-06-24 19:10

^{[citation needed]}

Name: Anonymous 2011-06-24 19:10

^{[citation needed]}

Name: Anonymous 2011-06-24 19:10

^{[citation needed]}

Name: Anonymous 2011-06-24 19:10

^{[citation needed]}

Name: Anonymous 2011-06-24 19:10

^{[citation needed]}

Name: Anonymous 2011-06-24 19:10

^{[citation needed]}

Name: Anonymous 2011-06-24 19:10

^{[citation needed]}

Name: Anonymous 2011-06-24 19:10

^{[citation needed]}

Name: Anonymous 2011-06-24 19:11

^{[citation needed]}

Name: Anonymous 2011-06-24 19:11

^{[citation needed]}

Name: Anonymous 2011-06-24 19:11

^{[citation needed]}

Name: Anonymous 2011-06-24 19:11

^{[citation needed]}

Name: Anonymous 2011-06-24 19:11

^{[citation needed]}

Name: Anonymous 2011-06-24 19:11

^{[citation needed]}

Name: Anonymous 2011-06-24 19:11

^{[citation needed]}

Name: Anonymous 2011-06-24 19:11

^{[citation needed]}

Name: Anonymous 2011-06-24 19:11

^{[citation needed]}

Name: Anonymous 2011-06-24 19:11

^{[citation needed]}

Name: Anonymous 2011-06-24 19:11

^{[citation needed]}

Name: Anonymous 2011-06-24 19:11

^{[citation needed]}

Name: Anonymous 2011-06-24 19:11

^{[citation needed]}

Name: Anonymous 2011-06-24 19:11

^{[citation needed]}

Name: Anonymous 2011-06-24 19:11

^{[citation needed]}

Name: Anonymous 2011-06-24 19:12

^{[citation needed]}

Name: Anonymous 2011-06-24 19:12

^{[citation needed]}

Name: Anonymous 2011-06-24 19:12

^{[citation needed]}

Name: Anonymous 2011-06-24 19:12

^{[citation needed]}

Name: Anonymous 2011-06-24 19:12

^{[citation needed]}

Name: Anonymous 2011-06-24 19:12

^{[citation needed]}

Name: Anonymous 2011-06-24 19:12

^{[citation needed]}

Name: Anonymous 2011-06-24 19:12

^{[citation needed]}

Name: Anonymous 2011-06-24 19:12

^{[citation needed]}

Name: Anonymous 2011-06-24 19:12

^{[citation needed]}

Name: Anonymous 2011-06-24 19:12

^{[citation needed]}

Name: Anonymous 2011-06-24 19:12

^{[citation needed]}

Name: Anonymous 2011-06-24 19:12

^{[citation needed]}

Name: Anonymous 2011-06-24 19:12

^{[citation needed]}

Name: Anonymous 2011-06-24 19:12

^{[citation needed]}

Name: Anonymous 2011-06-24 19:12

^{[citation needed]}

Name: Anonymous 2011-06-24 19:12

^{[citation needed]}

Name: Anonymous 2011-06-24 19:13

^{[citation needed]}

Name: Anonymous 2011-06-24 19:13

^{[citation needed]}

Name: Anonymous 2011-06-24 19:13

^{[citation needed]}

Name: Anonymous 2011-06-24 19:13

^{[citation needed]}

Name: Anonymous 2011-06-24 19:13

^{[citation needed]}

Name: Anonymous 2011-06-24 19:13

^{[citation needed]}

Name: Anonymous 2011-06-24 19:13

^{[citation needed]}

Name: Anonymous 2011-06-24 19:13

^{[citation needed]}

Name: Anonymous 2011-06-24 19:13

^{[citation needed]}

Name: Anonymous 2011-06-24 19:13

^{[citation needed]}

Name: Anonymous 2011-06-24 19:13

^{[citation needed]}

Name: Anonymous 2011-06-24 19:13

^{[citation needed]}

Name: Anonymous 2011-06-24 19:13

^{[citation needed]}

Name: Anonymous 2011-06-24 19:13

^{[citation needed]}

Name: Anonymous 2011-06-24 19:13

^{[citation needed]}

Name: Anonymous 2011-06-24 19:14

^{[citation needed]}

Name: Anonymous 2011-06-24 19:14

^{[citation needed]}

Name: Anonymous 2011-06-24 19:14

^{[citation needed]}

Name: Anonymous 2011-06-24 19:14

^{[citation needed]}

Name: Anonymous 2011-06-24 19:14

^{[citation needed]}

Name: Anonymous 2011-06-24 19:14

^{[citation needed]}

Name: Anonymous 2011-06-24 19:14

^{[citation needed]}

Name: Anonymous 2011-06-24 19:14

^{[citation needed]}

Name: Anonymous 2011-06-24 19:14

^{[citation needed]}

Name: Anonymous 2011-06-24 19:14

^{[citation needed]}

Name: Anonymous 2011-06-24 19:14

^{[citation needed]}

Name: Anonymous 2011-06-24 19:14

^{[citation needed]}

Name: Anonymous 2011-06-24 19:14

^{[citation needed]}

Name: Anonymous 2011-06-24 19:15

^{[citation needed]}

Name: Anonymous 2011-06-24 19:15

^{[citation needed]}

Name: Anonymous 2011-06-24 19:15

^{[citation needed]}

Name: Anonymous 2011-06-24 19:15

^{[citation needed]}

Name: Anonymous 2011-06-24 19:15

^{[citation needed]}

Name: Anonymous 2011-06-24 19:15

^{[citation needed]}

Name: Anonymous 2011-06-24 19:15

^{[citation needed]}

Name: Anonymous 2011-06-24 19:15

^{[citation needed]}

Name: Anonymous 2011-06-24 19:15

^{[citation needed]}

Name: Anonymous 2011-06-24 19:15

^{[citation needed]}

Name: Anonymous 2011-06-24 19:15

^{[citation needed]}

Name: Anonymous 2011-06-24 19:15

^{[citation needed]}

Name: Anonymous 2011-06-24 19:15

^{[citation needed]}

Name: Anonymous 2011-06-24 19:15

^{[citation needed]}

Name: Anonymous 2011-06-24 19:15

^{[citation needed]}

Name: Anonymous 2011-06-24 19:15

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:16

^{[citation needed]}

Name: Anonymous 2011-06-24 19:17

^{[citation needed]}

Name: Anonymous 2011-06-24 19:17

^{[citation needed]}

Name: Anonymous 2011-06-24 19:17

^{[citation needed]}

Name: Anonymous 2011-06-24 19:17

^{[citation needed]}

Name: Anonymous 2011-06-24 19:17

^{[citation needed]}

Name: Anonymous 2011-06-24 19:17

^{[citation needed]}

Name: Anonymous 2011-06-24 19:17

^{[citation needed]}

Name: Anonymous 2011-06-24 19:17

^{[citation needed]}

Name: Anonymous 2011-06-24 19:17

^{[citation needed]}

Name: Anonymous 2011-06-24 19:17

^{[citation needed]}

Name: Anonymous 2011-06-24 19:17

^{[citation needed]}

Name: Anonymous 2011-06-24 19:17

^{[citation needed]}

Name: Anonymous 2011-06-24 19:17

^{[citation needed]}

Name: Anonymous 2011-06-24 19:17

^{[citation needed]}

Name: Anonymous 2011-06-24 19:17

^{[citation needed]}

Name: Anonymous 2011-06-24 19:17

^{[citation needed]}

Name: Anonymous 2011-06-24 19:17

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:18

^{[citation needed]}

Name: Anonymous 2011-06-24 19:19

^{[citation needed]}

Name: Anonymous 2011-06-24 19:19

^{[citation needed]}

Name: Anonymous 2011-06-24 19:19

^{[citation needed]}

Name: Anonymous 2011-06-24 19:19

^{[citation needed]}

Name: Anonymous 2011-06-24 19:19

^{[citation needed]}

Name: Anonymous 2011-06-24 19:19

^{[citation needed]}

Name: Anonymous 2011-06-24 19:19

^{[citation needed]}

Name: Anonymous 2011-06-24 19:19

^{[citation needed]}

Name: Anonymous 2011-06-24 19:19

^{[citation needed]}

Name: Anonymous 2011-06-24 19:19

^{[citation needed]}

Name: Anonymous 2011-06-24 19:19

^{[citation needed]}

Name: Anonymous 2011-06-24 19:19

^{[citation needed]}

Name: Anonymous 2011-06-24 19:19

^{[citation needed]}

Name: Anonymous 2011-06-24 19:19

^{[citation needed]}

Name: Anonymous 2011-06-24 19:19

^{[citation needed]}

Name: Anonymous 2011-06-24 19:20

^{[citation needed]}

Name: Anonymous 2011-06-24 19:20

^{[citation needed]}

Name: Anonymous 2011-06-24 19:20

^{[citation needed]}

Name: Anonymous 2011-06-24 19:20

^{[citation needed]}

Name: Anonymous 2011-06-24 19:20

^{[citation needed]}

Name: Anonymous 2011-06-24 19:20

^{[citation needed]}

Name: Anonymous 2011-06-24 19:20

^{[citation needed]}

Name: Anonymous 2011-06-24 19:20

^{[citation needed]}

Name: Anonymous 2011-06-24 19:20

^{[citation needed]}

Name: Anonymous 2011-06-24 19:20

^{[citation needed]}

Name: Anonymous 2011-06-24 19:20

^{[citation needed]}

Name: Anonymous 2011-06-24 19:20

^{[citation needed]}

Name: Anonymous 2011-06-24 19:20

^{[citation needed]}

Name: Anonymous 2011-06-24 19:20

^{[citation needed]}

Name: Anonymous 2011-06-24 19:21

^{[citation needed]}

Name: Anonymous 2011-06-24 19:21

^{[citation needed]}

Name: Anonymous 2011-06-24 19:21

^{[citation needed]}

Name: Anonymous 2011-06-24 19:21

^{[citation needed]}

Name: Anonymous 2011-06-24 19:21

^{[citation needed]}

Name: Anonymous 2011-06-24 19:21

^{[citation needed]}

Name: Anonymous 2011-06-24 19:21

^{[citation needed]}

Name: Anonymous 2011-06-24 19:21

^{[citation needed]}

Name: Anonymous 2011-06-24 19:21

^{[citation needed]}

Name: Anonymous 2011-06-24 19:21

^{[citation needed]}

Name: Anonymous 2011-06-24 19:21

^{[citation needed]}

Name: Anonymous 2011-06-24 19:21

^{[citation needed]}

Name: Anonymous 2011-06-24 19:21

^{[citation needed]}

Name: Anonymous 2011-06-24 19:21

^{[citation needed]}

Name: Anonymous 2011-06-24 19:21

^{[citation needed]}

Name: Anonymous 2011-06-24 19:21

^{[citation needed]}

Name: Anonymous 2011-06-24 19:21

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:22

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:23

^{[citation needed]}

Name: Anonymous 2011-06-24 19:24

^{[citation needed]}

Name: Anonymous 2011-06-24 19:24

^{[citation needed]}

Name: Anonymous 2011-06-24 19:24

^{[citation needed]}

Name: Anonymous 2011-06-24 19:24

^{[citation needed]}

Name: Anonymous 2011-06-24 19:24

^{[citation needed]}

Name: Anonymous 2011-06-24 19:27

^{[citation needed]}

Name: Anonymous 2011-06-24 19:27

<sup>[citation needed]</sup>

Name: Anonymous 2011-06-24 19:35

^{[citation needed]}

Name: Anonymous 2011-06-24 19:36

^{[citation needed]}

Name: Anonymous 2011-06-24 19:36

^{[citation needed]}

Name: Anonymous 2011-06-24 19:36

^{[citation needed]}

Name: Anonymous 2011-06-24 19:36

^{[citation needed]}

Name: Anonymous 2011-06-24 19:36

^{[citation needed]}

Name: Anonymous 2011-06-24 19:36

^{[citation needed]}

Name: Anonymous 2011-06-24 19:37

^{[citation needed]}

Name: Anonymous 2011-06-24 19:37

^{[citation needed]}

Name: Anonymous 2011-06-24 19:37

^{[citation needed]}

Name: Anonymous 2011-06-24 19:37

^{[citation needed]}

Name: Anonymous 2011-06-24 19:37

^{[citation needed]}

Name: Anonymous 2011-06-24 19:37

^{[citation needed]}

Name: Anonymous 2011-06-24 19:37

^{[citation needed]}

Name: Anonymous 2011-06-24 19:37

^{[citation needed]}

Name: Anonymous 2011-06-24 19:37

^{[citation needed]}

Name: Anonymous 2011-06-24 19:37

^{[citation needed]}

Name: Anonymous 2011-06-24 19:37

^{[citation needed]}

Name: Anonymous 2011-06-24 19:37

^{[citation needed]}

Name: Anonymous 2011-06-24 19:37

^{[citation needed]}

Name: Anonymous 2011-06-24 19:37

^{[citation needed]}

Name: Anonymous 2011-06-24 19:37

^{[citation needed]}

Name: Anonymous 2011-06-24 19:37

^{[citation needed]}

Name: Anonymous 2011-06-24 19:38

^{[citation needed]}

Name: Anonymous 2011-06-24 19:38

^{[citation needed]}

Name: Anonymous 2011-06-24 19:38

^{[citation needed]}

Name: Anonymous 2011-06-24 19:38

^{[citation needed]}

Name: Anonymous 2011-06-24 19:38

^{[citation needed]}

Name: Anonymous 2011-06-24 19:38

^{[citation needed]}

Name: Anonymous 2011-06-24 19:38

^{[citation needed]}

Name: Anonymous 2011-06-24 19:38

^{[citation needed]}

Name: Anonymous 2011-06-24 19:38

^{[citation needed]}

Name: Anonymous 2011-06-24 19:38

^{[citation needed]}

Name: Anonymous 2011-06-24 19:38

^{[citation needed]}

Name: Anonymous 2011-06-24 19:38

^{[citation needed]}

Name: Anonymous 2011-06-24 19:38

^{[citation needed]}

Name: Anonymous 2011-06-24 19:38

^{[citation needed]}

Name: Anonymous 2011-06-24 19:39

^{[citation needed]}

Name: Anonymous 2011-06-24 19:39

^{[citation needed]}

Name: Anonymous 2011-06-24 19:39

^{[citation needed]}

Name: Anonymous 2011-06-24 19:39

^{[citation needed]}

Name: Anonymous 2011-06-24 19:39

^{[citation needed]}

Name: Anonymous 2011-06-24 19:39

^{[citation needed]}

Name: Anonymous 2011-06-24 19:39

^{[citation needed]}

Name: Anonymous 2011-06-24 19:39

^{[citation needed]}

Name: Anonymous 2011-06-24 19:39

^{[citation needed]}

Name: Anonymous 2011-06-24 19:39

^{[citation needed]}

Name: Anonymous 2011-06-24 19:40

^{[citation needed]}

Name: Anonymous 2011-06-24 19:40

^{[citation needed]}

Name: Anonymous 2011-06-24 19:40

^{[citation needed]}

Name: Anonymous 2011-06-24 19:40

^{[citation needed]}

Name: Anonymous 2011-06-24 19:40

^{[citation needed]}

Name: Anonymous 2011-06-24 19:40

^{[citation needed]}

Name: Anonymous 2011-06-24 19:40

^{[citation needed]}

Name: Anonymous 2011-06-24 19:40

^{[citation needed]}

Name: Anonymous 2011-06-24 19:40

^{[citation needed]}

Name: Anonymous 2011-06-24 19:40

^{[citation needed]}

Name: Anonymous 2011-06-24 19:40

^{[citation needed]}

Name: Anonymous 2011-06-24 19:40

^{[citation needed]}

Name: Anonymous 2011-06-24 19:40

^{[citation needed]}

Name: Anonymous 2011-06-24 19:41

^{[citation needed]}

Name: Anonymous 2011-06-24 19:41

^{[citation needed]}

Name: Anonymous 2011-06-24 19:41

^{[citation needed]}

Name: Anonymous 2011-06-24 19:41

^{[citation needed]}

Name: Anonymous 2011-06-24 19:41

^{[citation needed]}

Name: Anonymous 2011-06-24 19:41

^{[citation needed]}

Name: Anonymous 2011-06-24 19:41

^{[citation needed]}

Name: Anonymous 2011-06-24 19:41

^{[citation needed]}

Name: Anonymous 2011-06-24 19:41

^{[citation needed]}

Name: Anonymous 2011-06-24 19:41

^{[citation needed]}

Name: Anonymous 2011-06-24 19:41

^{[citation needed]}

Name: Anonymous 2011-06-24 19:41

^{[citation needed]}

Name: Anonymous 2011-06-24 19:41

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:42

^{[citation needed]}

Name: Anonymous 2011-06-24 19:43

^{[citation needed]}

Name: Anonymous 2011-06-24 19:43

^{[citation needed]}

Name: Anonymous 2011-06-24 19:43

^{[citation needed]}

Name: Anonymous 2011-06-24 19:43

^{[citation needed]}

Name: Anonymous 2011-06-24 19:43

^{[citation needed]}

Name: Anonymous 2011-06-24 19:43

^{[citation needed]}

Name: Anonymous 2011-06-24 19:43

^{[citation needed]}

Name: Anonymous 2011-06-24 19:43

^{[citation needed]}

Name: Anonymous 2011-06-24 19:43

^{[citation needed]}

Name: Anonymous 2011-06-24 19:43

^{[citation needed]}

Name: Anonymous 2011-06-24 19:43

^{[citation needed]}

Name: Anonymous 2011-06-24 19:43

^{[citation needed]}

Name: Anonymous 2011-06-24 19:43

^{[citation needed]}

Name: Anonymous 2011-06-24 19:43

^{[citation needed]}

Name: Anonymous 2011-06-24 19:43

^{[citation needed]}

Name: Anonymous 2011-06-24 19:44

^{[citation needed]}

Name: Anonymous 2011-06-24 19:44

^{[citation needed]}

Name: Anonymous 2011-06-24 19:44

^{[citation needed]}

Name: Anonymous 2011-06-24 19:44

^{[citation needed]}

Name: Anonymous 2011-06-24 19:44

^{[citation needed]}

Name: Anonymous 2011-06-24 19:44

^{[citation needed]}

Name: Anonymous 2011-06-24 19:44

^{[citation needed]}

Name: Anonymous 2011-06-24 19:44

^{[citation needed]}

Name: Anonymous 2011-06-24 19:44

^{[citation needed]}

Name: Anonymous 2011-06-24 19:44

^{[citation needed]}

Name: Anonymous 2011-06-24 19:44

^{[citation needed]}

Name: Anonymous 2011-06-24 19:44

^{[citation needed]}

Name: Anonymous 2011-06-24 19:44

^{[citation needed]}

Name: Anonymous 2011-06-24 19:44

^{[citation needed]}

Name: Anonymous 2011-06-24 19:44

^{[citation needed]}

Name: Anonymous 2011-06-24 19:44

^{[citation needed]}

Name: Anonymous 2011-06-24 19:45

^{[citation needed]}

Name: Anonymous 2011-06-24 19:45

^{[citation needed]}

Name: Anonymous 2011-06-24 19:45

^{[citation needed]}

Name: Anonymous 2011-06-24 19:45

^{[citation needed]}

Name: Anonymous 2011-06-24 19:45

^{[citation needed]}

Name: Anonymous 2011-06-24 19:45

^{[citation needed]}

Name: Anonymous 2011-06-24 19:45

^{[citation needed]}

Name: Anonymous 2011-06-24 19:45

^{[citation needed]}

Name: Anonymous 2011-06-24 19:45

^{[citation needed]}

Name: Anonymous 2011-06-24 19:45

^{[citation needed]}

Name: Anonymous 2011-06-24 19:45

^{[citation needed]}

Name: Anonymous 2011-06-24 19:45

^{[citation needed]}

Name: Anonymous 2011-06-24 19:45

^{[citation needed]}

Name: Anonymous 2011-06-24 19:45

^{[citation needed]}

Name: Anonymous 2011-06-24 19:45

^{[citation needed]}

Name: Anonymous 2011-06-24 19:46

^{[citation needed]}

Name: Anonymous 2011-06-24 19:46

^{[citation needed]}

Name: Anonymous 2011-06-24 19:46

^{[citation needed]}

Name: Anonymous 2011-06-24 19:46

^{[citation needed]}

Name: Anonymous 2011-06-24 19:46

^{[citation needed]}

Name: Anonymous 2011-06-24 19:46

^{[citation needed]}

Name: Anonymous 2011-06-24 19:46

^{[citation needed]}

Name: Anonymous 2011-06-24 19:46

^{[citation needed]}

Name: Anonymous 2011-06-24 19:46

^{[citation needed]}

Name: Anonymous 2011-06-24 19:46

^{[citation needed]}

Name: Anonymous 2011-06-24 19:46

^{[citation needed]}

Name: Anonymous 2011-06-24 19:46

^{[citation needed]}

Name: Anonymous 2011-06-24 19:46

^{[citation needed]}

Name: Anonymous 2011-06-24 19:46

^{[citation needed]}

Name: Anonymous 2011-06-24 19:46

^{[citation needed]}

Name: Anonymous 2011-06-24 19:47

^{[citation needed]}

Name: Anonymous 2011-06-24 19:47

^{[citation needed]}

Name: Anonymous 2011-06-24 19:47

^{[citation needed]}

Name: Anonymous 2011-06-24 19:47

^{[citation needed]}

Name: Anonymous 2011-06-24 19:47

^{[citation needed]}

Name: Anonymous 2011-06-24 19:47

^{[citation needed]}

Name: Anonymous 2011-06-24 19:47

^{[citation needed]}

Name: Anonymous 2011-06-24 19:47

^{[citation needed]}

Name: Anonymous 2011-06-24 19:47

^{[citation needed]}

Name: Anonymous 2011-06-24 19:47

^{[citation needed]}

Name: Anonymous 2011-06-24 19:47

^{[citation needed]}

Name: Anonymous 2011-06-24 19:47

^{[citation needed]}

Name: Anonymous 2011-06-24 19:47

^{[citation needed]}

Name: Anonymous 2011-06-24 19:47

^{[citation needed]}

Name: Anonymous 2011-06-24 19:47

^{[citation needed]}

Name: Anonymous 2011-06-24 19:48

^{[citation needed]}

Name: Anonymous 2011-06-24 19:48

^{[citation needed]}

Name: Anonymous 2011-06-24 19:48

^{[citation needed]}

Name: Anonymous 2011-06-24 19:48

^{[citation needed]}

Name: Anonymous 2011-06-24 19:48

^{[citation needed]}

Name: Anonymous 2011-06-24 19:48

^{[citation needed]}

Name: Anonymous 2011-06-24 19:48

^{[citation needed]}

Name: Anonymous 2011-06-24 19:48

^{[citation needed]}

Name: Anonymous 2011-06-24 19:48

^{[citation needed]}

Name: Anonymous 2011-06-24 19:48

^{[citation needed]}

Name: Anonymous 2011-06-24 19:48

^{[citation needed]}

Name: Anonymous 2011-06-24 19:48

^{[citation needed]}

Name: Anonymous 2011-06-24 19:48

^{[citation needed]}

Name: Anonymous 2011-06-24 19:48

^{[citation needed]}

Name: Anonymous 2011-06-24 19:48

^{[citation needed]}

Name: Anonymous 2011-06-24 19:48

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:49

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:50

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:51

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:52

^{[citation needed]}

Name: Anonymous 2011-06-24 19:53

^{[citation needed]}