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

Pages: 1-4041-

Sorting

Name: Anonymous 2009-04-20 16:19

Does anyone have a program that sorts alphabetically. What type of sort does it do? I'm trying to collect different alphabetical sorts to benchmark them.

Name: Anonymous 2009-04-20 16:20

OP here forgot a part. Preferably in C or C++

Name: Anonymous 2009-04-20 16:24

php_sort_alphabetical_english_ascending

Name: Anonymous 2009-04-20 16:25

even wikipedia has articles on this

Name: Anonymous 2009-04-20 16:43

man sort

Name: Anonymous 2009-04-20 16:53

look at the source code of sort

Name: Anonymous 2009-04-20 19:05

>>6
...

Name: Anonymous 2009-04-20 20:08

How about this? C code for several sorting algorithms: http://www.softpanorama.org/Algorithms/sorting.shtml

Name: Anonymous 2009-04-20 20:26

the only sorting algorithms that matter anymore are radix sort, merge sort, and quick sort.

Name: Anonymous 2009-04-20 22:48

>>9
You forgot ninja sort.

Name: Anonymous 2009-04-21 1:51

>>9
Heapsort still sees a lot of use.

Name: Anonymous 2009-04-21 3:06

>>9
Actually, quantum bogosort has yet to be disproven, and as such matters immensely if we wish to achieve O(1) sort.

Name: Anonymous 2009-04-21 3:12

>>11
that's because there are a lot of idiots who don't realize that heapsort sucks. one of those other three sorts is almost always better.

>>12
quantum bogosort is irrelevant unless you have a quantum computer to run it on.
quantum computing is slowly dying, and probably won't recover with every government in the world trying to fuck up the global economy as much as they can.

Name: Anonymous 2009-04-21 3:22

>>13
quantum computing is slowly dying, and probably won't recover
.....IHBT

Name: Anonymous 2009-04-21 4:37

>>13
Some people prefer their in-place sorting algorithms to have better than O(n^2) worst-case running time. Crazy, I know.

Name: Anonymous 2009-04-21 11:25

>>12
Quantum Bogosort is O(n), bro.

>>15
What about introsort?

Name: Anonymous 2009-04-21 12:37

I can sort arrays of length 1 faster than quicksort

Name: Anonymous 2009-04-21 12:58

>>16
Quantum bogosort is bounded by the available matter in the universe, and as such on the set which it is able to operate is O(1).

Name: Anonymous 2009-04-22 10:37

>>18
I'm intrigued. Please post more info about quantum bojosort

Name: Anonymous 2009-04-22 10:41

>>19
http://en.wikipedia.org/wiki/Bogosort#Quantum_Bogosort

Name: Anonymous 2009-04-22 10:52

>>18
Still O(n) in time because it requires n comparisons

Name: Anonymous 2009-04-22 11:08

>>21
No. Read a formal definition of Big O Notation and you will understand why it is constant time.

Name: Anonymous 2009-04-22 11:16

>>22
The very first sentence in the Wikipedo link is:
An in-joke among some computer scientists is that quantum computing could be used to effectively implement a bogosort with a time complexity of O(n).
I mean, it seems like a pretty open and shut case to me, quite literally.

Name: Anonymous 2009-04-22 11:26

>>23
Right, and wikipedia is always right? For all intensive purposes it is O(n), but on a technicality it is infact O(1).

Name: Anonymous 2009-04-22 12:14

>>24
s/technicality/complete failure to understand the problem/

Name: Anonymous 2009-04-22 13:41

∀ intensive purposes
WHBTC.

Name: Anonymous 2009-04-22 13:42

hhahax hax mhax my anus!
 anus!
nus!
us!
s!

Name: Anonymous 2009-04-22 16:02

>>24
>For all intensive purposes
That's "For all intents and purposes".  HTH HAND

Name: Anonymous 2009-04-22 16:09

>>28
IHBMT

Name: Anonymous 2009-04-22 16:57

>>28
Intensive Porpoises

Name: Anonymous 2009-04-22 18:51

>>30
Intensive Tortoises

Name: Anonymous 2009-04-22 23:46

>>31
My mother has three pet turtles and there's this one in particular that has his arm broken and it seems that it will not heal. So he keeps trying to chew his arm off and he's gotten all the way to the bone. This does not bother him one bit and he doesn't seem to be in any pain. One badass son of a bitch.

Name: Anonymous 2011-01-05 8:26

Heap sort

Name: Anonymous 2011-01-05 11:16

necro sort

Name: Anonymous 2011-01-05 11:19

Hip sort

Name: Dmitry Vyukov 2011-01-05 11:31

Radix Sort

Name: Anonymous 2011-01-05 11:32

Radicks Sort

Name: Anonymous 2011-01-05 11:51

Dijkstra's Constant Time Sort

Name: Anonymous 2011-01-05 11:54

Rabbits sort

Name: Anonymous 2011-01-05 15:17

Fibonacci buttsort?

Name: Anonymous 2011-01-05 23:26

Bogosort.

Name: Anonymous 2011-01-05 23:29

HoboNigger Inc. Visual Enterprise[tm] Dickcheese sort

Name: Anonymous 2011-01-06 1:36

>>9
>quick sort.
U MEAN INTROSORT. Because O(n²) is for pussies.

Name: Anonymous 2011-01-06 6:50

Blackie Snorts

Name: Anonymous 2011-01-06 6:53

>>41
FIBONACCI BUTTSORT

Name: Haxus sort 2011-01-06 14:54

Haxus sort

Name: Haxus The Sorter 2011-01-06 15:17

Haxus The Sorter

Name: Anonymous 2011-01-06 15:34

(defun sort-strings (&rest strings) (sort strings #'string<))

(sort-strings "vip" "quality" "c" "cdr" "car" "cudder")
("c" "car" "cdr" "cudder" "quality" "vip")

Name: Anonymous 2011-01-06 16:01

(define (sort-strings . strings) (sort strings string<?))

(sort-strings "vip" "quality" "c" "cdr" "car" "cudder")
'("c" "car" "cdr" "cudder" "quality" "vip")

Name: Anonymous 2011-01-06 18:45

>>49-50
faggot language detected.

Name: Anonymous 2011-01-06 18:46

>>51
faggot faggot detected.

Name: Anonymous 2011-01-06 20:00

>>52
“faggot” “faggot”, ``“faggot”''.

Name: VIP 2011-01-07 1:04

>>53
That post made me wet

Name: Anonymous 2011-01-31 19:46

<-- check em dubz
Don't change these.
Name: Email:
Entire Thread Thread List
All trademarks and copyrights on this site are owned by their respective parties. All comments and posts are the responsibility of their own posters.
- Tinychan + 2ch Mode -