The Best Sorting Algorithm
1
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.
2
Name:
Anonymous
2009-09-07 21:50
bubble
3
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.
4
Name:
Anonymous
2009-09-07 21:51
quick and shell sort.
5
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!.
6
Name:
Anonymous
2009-09-07 21:58
Merge Sort - I find it beautiful in it's simplicity
7
Name:
Anonymous
2009-09-07 21:59
damn, i've forgotten how most of these work.
8
Name:
Anonymous
2009-09-07 22:00
Quick Sort
It's quick, it gets the job done!
9
Name:
Anonymous
2009-09-07 22:04
Bogosort
10
Name:
Anonymous
2009-09-07 22:05
Quicksort, because it's a one-liner in Haskell
11
Name:
Anonymous
2009-09-07 22:06
12
Name:
Anonymous
2009-09-07 22:08
#Bogosort
13
Name:
Anonymous
2009-09-07 22:10
Geimen sort
14
Name:
Anonymous
2009-09-07 22:12
- Butt sort
15
Name:
Anonymous
2009-09-07 22:14
>>14
Did you mean:
B u t t s o r t
16
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.
17
Name:
Anonymous
2009-09-07 22:17
Radix sort. Can't beat O(kn) .
19
Name:
Anonymous
2009-09-07 22:23
Gnome sort
20
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
22
Name:
Anonymous
2009-09-07 22:43
Sort sort sort
23
Name:
Anonymous
2009-09-07 22:48
Bubble Sort
24
Name:
Anonymous
2009-09-07 22:50
quicksort
25
Name:
Anonymous
2009-09-07 22:55
LOOL NOT %25
26
Name:
Anonymous
2009-09-07 22:55
LOOL NOT %25
28
Name:
Anonymous
2009-09-07 23:21
radix sort. because O(n ) is better than O(n logn ).
29
Name:
Anonymous
2009-09-07 23:26
>>25
>>26
Back to
Kindergarten .
30
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
32
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.
33
Name:
Anonymous
2009-09-08 0:14
Quantum bogosort, because O(N) is better than O(kN).
34
Name:
Anonymous
2009-09-08 0:33
Nigger sort, followed by jew sort
35
Name:
Anonymous
2009-09-08 0:47
>>33
Quantum quantumsort, because O(1) is better than O(N).
36
Name:
Anonymous
2009-09-08 1:03
O ( b u t t ) time
37
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?»
38
Name:
Anonymous
2009-09-08 2:24
Fibonacci Butt Sort
39
Name:
Anonymous
2009-09-08 3:33
haha he said insertion
40
Name:
Anonymous
2009-09-08 3:34
Quicksort is moe~.
Newer Posts