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

The Best Sorting Algorithm

Name: Anonymous 2009-09-07 21:49

In this thread we will discuss sorting algorithms and vote for our favorite one.

I will update the stats every postIndex % 25 posts.  

May the best #sort win!

- Bubble Sort
- Insertion Sort
- Selection Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Shell Sort
- Bucket Sort
- Radix Sort


Vote for one of these or any sort you like. I'll add new sorts to the list when I update stats.

Name: Anonymous 2009-09-07 21:50

bubble

Name: Anonymous 2009-09-07 21:51

Vote: Insertion sort.

Its the most practical of the sorts to implement and it runs just fine in most cases.

Name: Anonymous 2009-09-07 21:51

quick and shell sort.

Name: Anonymous 2009-09-07 21:54

Bubble - First sort I ever learned. I still haven't looked into the others.

Finally a non-troll programming related topic on the front page!.

Name: Anonymous 2009-09-07 21:58

Merge Sort - I find it beautiful in it's simplicity

Name: Anonymous 2009-09-07 21:59

damn, i've forgotten how most of these work.

Name: Anonymous 2009-09-07 22:00

Quick Sort

It's quick, it gets the job done!

Name: Anonymous 2009-09-07 22:04

Bogosort

Name: Anonymous 2009-09-07 22:05

Quicksort, because it's a one-liner in Haskell

Name: Anonymous 2009-09-07 22:06

>>9
Comedy gold!

Name: Anonymous 2009-09-07 22:08

#Bogosort

Name: Anonymous 2009-09-07 22:10

Geimen sort

Name: Anonymous 2009-09-07 22:12

- Butt sort

Name: Anonymous 2009-09-07 22:14

>>14
Did you mean:
Butt sort

Name: Anonymous 2009-09-07 22:15

Bubble sort, because while it's not actually good, it really hangs in there and is the first sort anybody learns. I admire its persistence.

Name: Anonymous 2009-09-07 22:17

Radix sort. Can't beat O(kn).

Name: Anonymous 2009-09-07 22:23

Gnome sort

Name: Anonymous 2009-09-07 22:26

>>18
If your going to spam the thread, at least respect it's intentions and sort your contents first

Name: Anonymous 2009-09-07 22:43

Sort sort sort

Name: Anonymous 2009-09-07 22:48

Bubble Sort

Name: Anonymous 2009-09-07 22:50

quicksort

Name: Anonymous 2009-09-07 22:55

LOOL NOT %25

Name: Anonymous 2009-09-07 22:55

LOOL NOT %25

Name: Anonymous 2009-09-07 23:21

radix sort. because O(n) is better than O(nlogn).

Name: Anonymous 2009-09-07 23:26

>>25
>>26
Back to Kindergarten .

Name: Anonymous 2009-09-07 23:43

>>16
The first sort I learned was quicksort, thank you very much.

I learned it from the Haskell 1-liner mentioned in >>10

Name: Haxus the Sorter 2009-09-07 23:59

Haxus the Sorter

Name: Anonymous 2009-09-08 0:10

>>16
Perhaps the first most people learn formally, but the majority of people have an intuitive grasp of insertion sort.

Name: Anonymous 2009-09-08 0:14

Quantum bogosort, because O(N) is better than O(kN).

Name: Anonymous 2009-09-08 0:33

Nigger sort, followed by jew sort

Name: Anonymous 2009-09-08 0:47

>>33
Quantum quantumsort, because O(1) is better than O(N).

Name: Anonymous 2009-09-08 1:03

O(butt) time

Name: =+=*=F=R=O=Z=E=N==V=O=I=D=*=+= !frozEn/KIg 2009-09-08 2:09

Heap Sort



________________________________________________
http://bayimg.com/image/aadbjaace.jpg
Velox Et Astrum gamedev forum: http://etastrum.phpbb3now.com
My Blog: http://frozenvoid.blogspot.com/
«We hold life to be sacred, but we also know the foundation of life consists in a stream of codes not so different from the successive frames of a watchvid. Why then cannot we cut one code short here, and start another there? Is life so fragile that it can withstand no tampering? Does the sacred brook no improvement?»

Name: Anonymous 2009-09-08 2:24

Fibonacci Butt Sort

Name: Anonymous 2009-09-08 3:33

haha he said insertion

Name: Anonymous 2009-09-08 3:34

Quicksort is moe~.

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