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

Sorting

Name: Anonymous 2008-10-25 19:37

sup /prog/,

what's your favorite sorting algorithm?

mine is heapsort. not really sure why, but it appeals to me.

a close second would be sorting by counting. its a pretty clever algorithm, imo.

Name: Anonymous 2008-10-25 19:41

it sure is first year compsci in here.

Name: Anonymous 2008-10-25 19:59

i approve only of randomsort

Name: Anonymous 2008-10-25 20:31

>>2
Better than being DQN, like usual.

Name: Anonymous 2008-10-25 20:34

Dicksnort

Name: Anonymous 2008-10-25 20:40

OP here. I love binary trees because I just learned what they are.

Name: Anonymous 2008-10-25 20:47

OP here. I love cocks because I just learned what they are.

Name: Anonymous 2008-10-25 20:50

Bubble sorts are pretty to watch.

Name: Anonymous 2008-10-25 21:32

Beadsort.

Name: Anonymous 2008-10-25 21:35

Morgothsort. It's where you take everything on the heap, subtract 666, delete the original values, and return the new ones unordered.

Name: Anonymous 2008-10-25 21:59

Ninjasort.

Name: Anonymous 2008-10-26 4:54

As a third year CS, I have to say, it's a shame how many people live in ignorance of teh radix sort.

Name: Anonymous 2008-10-26 6:07

>>12
As a master of computer science and related topics and master of industry best practice programming(tm), I have to say: It's a shame they still tell people at university to code their own sort algorithms.

Name: Anonymous 2008-10-26 6:29

I've discovered an o(n) sorting algorithm,
if you payme enough I will let you into my secret area of sorting algorithms ;)

Name: Anonymous 2008-10-26 10:08

Randomsort.

Name: Anonymous 2008-10-26 10:26

>>13
The only reason they teach sorting algorithms is because it's a good way to make students understand how to code generic algorithms, algorithm efficiency and Big O notation.

Name: Anonymous 2008-10-26 10:37

>>14
Bucket sort?

Name: Anonymous 2008-10-26 11:07

>>14
fairX?

Name: Anonymous 2008-10-26 15:45

>>18
Yes, that is indeed the meme that post is very obviously referencing. You are quite clever for figuring that out.

Name: Anonymous 2008-10-26 18:29

hello im fairX the haxxor join my community of hackers if you payme enough i will give you access to a private area of hax ;)
http://forum.curse-x.com/index.php

Name: Anonymous 2008-10-26 18:38

I'm all over that mergesort

Name: Anonymous 2008-10-26 18:58

Quicksort is the only good choice.

Name: Anonymous 2008-10-26 19:16

BubbleSort.

If it isn't fast enough, just add more hardware at the problem.

Name: Anonymous 2008-10-26 19:24

I like to watch the bubbles sort in my bong.

Name: Anonymous 2008-10-26 19:50

>>22
Hoaresort

Name: Anonymous 2008-10-26 19:50

>>22
Well yes and no. There is code that makes quicksort [bold]O(n2)[/bold].

Name: Anonymous 2008-10-26 20:15

>>25
My professor is Hoare.

Name: Anonymous 2008-10-26 20:35

>>26
I actually have a quicksort algorithm that runs in O(n) time, but I am under an NDA and can't give it out ever. Sorry folks.

Name: Anonymous 2008-10-26 21:04

>>14,28
Sorry to give it up, but: Quantum bogosort.

Name: Anonymous 2008-10-26 21:33

>>29
Well, that really depends on your definition of time.

Name: Anonymous 2008-10-26 22:39

>>26
code that makes quicksort [bold]O(n2)[/bold].
ಠ_ಠ x 2

Name: Anonymous 2008-10-27 14:54

ಠvಠ

Name: Anonymous 2008-10-27 14:54

ಠoಠ

Name: Anonymous 2008-10-27 14:56

ಠxಠ

Name: Anonymous 2008-10-27 14:56

ಠ.ಠ

Name: Anonymous 2008-10-27 14:57

ಠUಠ

Name: Anonymous 2008-10-27 15:08

Would anyone please explain heapsort to me? I meant, after building the heap tree, what determines which tree branch you go down?

Name: Anonymous 2008-10-27 15:09

Histogram sort.  It's the only way to be sure.

Name: Anonymous 2008-10-27 16:28

ಠJಠ

Name: Anonymous 2008-10-27 18:12

ಠEಠ

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