help needed on sort routines

[Leiak]

i am doing a grade 11 compsci exam tomorrow and i know everything fine except im a lil in the dark on the sort routines i know its like

for x : 1..100
for y:1..100-x or something likethat then u set em all to equal each other but im not 100% sure any help is appreciated

[AsianSensation]

bubble sort:

code:

for x : 1 .. 99     for y : x + 1 .. 100     end for end for

[McKenzie]

google "bubble sort" ==

code:

for (i=0; i<n-1; i++) {   for (j=0; j<n-1-i; j++)     if (a[j+1] < a[j]) {  /* compare the two neighbors */       tmp = a[j];         /* swap a[j] and a[j+1]      */       a[j] = a[j+1];       a[j+1] = tmp;   } }

I know it's in C, but ... give it a look

[Delos]

Good grief! Put that Java away!

[shorthair]

Quote:

McKenzie Wrote , "i know its in C but.."

Quote:

Delos Wrote , "good grief put that java away"

Am i missing somthing

[Delos]

shorthair wrote:

Quote:

McKenzie Wrote , "i know its in C but.."

Quote:

Delos Wrote , "good grief put that java away"

Am i missing somthing

My bad...didn't read properly.

But it looks like JAVA! Argggghhhh.

Seriously, the whole curly brackets and double + thing and all. Yes, I am aware of those being industry standard. Sorta.

[shorthair]

Okay , i wsa just wondering how ou got java from his post , , but what is hte pointo f bubble sorting ? What does it do ?

[Dan]

well techaly there is almost no difencte between the code in java and the code in c or c++ for that.

also you left out a break there for the if....

[McKenzie]

McKenzie wrote:

google "bubble sort" ==

The point I was making is don't be afraid to jump on google to find code. If I were to type it myself I wouldn't use C in a Turing forum. I invested a whole 10 seconds finding the code. As far as the break goes the basic version of the bubble sort doesn't have it.

[Delos]

shorthair wrote:

Okay , i wsa just wondering how ou got java from his post , , but what is hte pointo f bubble sorting ? What does it do ?

Bubble sort...bubble sort.

How do I scoff thee?

Anyhow, bubble sorts are almost entirely deprecated. i.e., you would never use one to sort a list of more than 2 elements.

What they do is compare adjacent elements, and if the first is greater than the second, it switches them. It keeps doing this until the list is completely sorted.

Eg.

3 4 1 8 4 6
3 4 1 4 8 6
3 1 4 4 6 8
1 3 4 4 6 8

That may seem odd, the way it switches, but that's about how it works.

For a short list, no problem. For the average list that one would need sorted...it is sloooooooow.