Sorting Data: Bubble Sort

[Gambet]

Simple bubble sort algorithm used when sorting data from least to greatest or from greatest to least. Bubble sorting is one of the slowest algorithms for sorting data, but, it's good enough when you have to sort arrays with a small number of data.


Least to Greatest:

PHP Code:

//#CLIENTSIDE
function onCreated()
{
  this.example = {1,6,4,2,5,8,20,100,54,1000,523};
  LeastToGreatest(this.example);
}

function LeastToGreatest(array) 
{
  for (a=0; a<array.size()-1; a++) 
  {
    for (b=0; b<array.size()-1-a; b++) 
    {
      if (array[b+1] < array[b]) 
      {
         this.temp = array[b];
         array[b] = array[b+1];
         array[b+1] = this.temp;
         this.results = array;
         player.chat = this.results;
      }
    }
  }
} 


Greatest to Least:

PHP Code:

//#CLIENTSIDE
function onCreated()
{
  this.example = {1,6,4,2,5,8,20,100,54,1000,523};
  GreatestToLeast(this.example);
}

function GreatestToLeast(array) 
{
  for (a=0; a<array.size()-1; a++) 
  {
    for (b=0; b<array.size()-1-a; b++) 
    {
      if (array[b+1] > array[b]) 
      {
         this.temp = array[b];
         array[b] = array[b+1];
         array[b+1] = this.temp;
         this.results = array;
         player.chat = this.results;
      }
    }
  }
} 


[napo_p2p]

Good example and all... but sort of unnecessary.

I'm almost 100% sure that Graal has a built-in command for sorting arrays.

[Chompy]

Originally Posted by Gambet

Simple bubble sort algorithm used when sorting data from least to greatest or from greatest to least. Bubble sorting is one of the slowest algorithms for sorting data, but, it's good enough when you have to sort arrays with a small number of data.


Least to Greatest:

PHP Code:

... 


Greatest to Least:

PHP Code:

... 


Both examples are almost the same,
' if (array[b+1] < array[b]) ' is only changing

Nice script tho Gambet

Here is maybe how I would do it

PHP Code:

//#CLIENTSIDE
function onCreated()
{
  temp.example = {1,6,4,2, 5,8,20,100,54,1000,523};
  doFunction( "GreatestToLast", temp.example);
}

function doFunction( mode, array) 
{
  for ( temp.a = 0; temp.a < temp.array.size() - 1; temp.a ++) 
  {
    for ( temp.b = 0; temp.b < temp.array.size() - 1 - temp.a; temp.b ++) 
    {
      if ( temp.mode == "GreatestToLast")
      {
        if ( temp.array[ temp.b + 1] > temp.array[ temp. b]) 
        {
           this.temp = temp.array[ temp.b];
           temp.array[ temp.b] = temp.array[ temp.b + 1];
           temp.array[ temp.b + 1] = this.temp;
           this.results = temp.array;
           player.chat = this.results;
        }
      }else
      {
        if ( temp.mode == "LeastToGreatest")
        {
          if ( temp.array[ temp.b + 1] < temp.array[ temp.b]) 
          {
             this.temp = temp.array[ temp.b];
             temp.array[ temp.b] = temp.array[ temp.b + 1];
             temp.array[ temp.b + 1] = this.temp;
             this.results = temp.array;
             player.chat = this.results;
          }
        }
      }
    }
  }
} 


[Gambet]

Yes, would be more efficient for you to combine the two into one function. I separated the two merely just to show how to do each, and yes, to do one or the other only requires a flip in the symbol.

Originally Posted by napo_p2p

I'm almost 100% sure that Graal has a built-in command for sorting arrays.

???

You mean sortascending() and sortdescending() for TGraalVars?

[Tolnaftate2004]

Originally Posted by Chompy

Both examples are almost the same,
' if (array[b+1] < array[b]) ' is only changing

Nice script tho Gambet

Here is maybe how I would do it

PHP Code:

blah blah blah 


PHP Code:

//#CLIENTSIDE
function onCreated(){
  temp.example = {1,6,4,2, 5,8,20,100,54,1000,523};
  doFunction("GreatestToLast", temp.example);
}
function doFunction(mode, array) {
  temp.s = (mode=="GreatestToLast"? 1:(mode=="LeastToGreatest"? -1:0));
  temp.len = temp.array.size();
  for (temp.a = 0; temp.a < temp.len - 1; temp.a ++) {
    for (temp.b = 0; temp.b < temp.len - 1 - temp.a; temp.b ++) {
        if (temp.s*temp.array[temp.b + 1] > temp.s*temp.array[temp. b]) {
           this.temp = temp.array[temp.b];
           temp.array[temp.b] = temp.array[temp.b + 1];
           temp.array[temp.b + 1] = this.temp;
           this.results = temp.array;
           player.chat = this.results;
        }
      }
    }
  }
} 


Or something of the sort.

[Admins]

Nice code
sortascending()/sortdescending() currently only sort strings, so it's not helping in all cases. You can also use sortbyvalue() but it is more made for sorting objects

[Draenin]

This is pretty useful. I have a tendency to do a lot of stuff the manual way too, because it makes it easier to insert or remove needed or unneeded actions in a function.

[Gambet]

Yes, figured this would be useful to people.

Using the built-in commands/functions is always a nice thing, but it does you no good if you don't understand the concepts behind them (i.e how to do them the manual way and so forth).

Originally Posted by Stefan

Nice code
sortascending()/sortdescending() currently only sort strings, so it's not helping in all cases. You can also use sortbyvalue() but it is more made for sorting objects

Which is why it's always nice to learn how to do things the manual way, just in case you're in a situation where you will need to script a function manually