Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-

Sleepsort on Brainfuck (for experts only)

Name: Anonymous 2013-12-09 16:47

Well, here is one of my favourite algorithms in one of my favourite languages.


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


input: 15203569\n
output: 01235569


Double the uselessness and fun

Name: Anonymous 2013-12-09 16:51

Uselessness?
Are you saying that an O(1) sorting algorithm is somehow useless?

Name: Anonymous 2013-12-09 17:59

more like O(n*log^n+2)

Name: Anonymous 2013-12-09 18:41

>>3
How did you come up with such an oddly specific figure?
Constants generally aren't included in big O notation

Name: Anonymous 2013-12-09 20:44

This ``shit'' is O(n2)

Name: Anonymous 2013-12-09 21:24

>>5
This ``shit'' is O(n)

Name: Anonymous 2013-12-09 21:25

>>5-6
Shit ``this'' O(haxedanus) is

Name: Anonymous 2013-12-10 2:23

check my doubles

Name: Anonymous 2013-12-10 2:37

Maximum time is 2^32, because lol integers.
Therefore constant time.

Name: Anonymous 2013-12-10 10:19

>>9
Maximum time is 2^32, because lol integers.
That's not CS!

Name: Anonymous 2013-12-10 10:19

My dbus! Check 'em

Name: Anonymous 2013-12-11 12:57

>>8,11
Back to the imageboards, please.

Name: Anonymous 2013-12-11 19:27

>>9
actually it is 256 because lol brainfuck

Name: Anonymous 2013-12-11 21:11

>>12
>le pedophile sage

Name: Anonymous 2013-12-13 11:44

u mad?

Name: Anonymous 2013-12-13 14:03

u mad?

Don't change these.
Name: Email:
Entire Thread Thread List