SortBubble( array, collation)

[MrOmega]

Well, redid this script and used the bubble method of sorting, simple to understand.

parameter:
1st - Array to Sort
2nd - Collation to use, if NULL it will use AlphaNumeric Collation

Script:

PHP Code:

function sortBubble( temp.list, temp.order)
{

  if ( !temp.order)
  {
  
    temp.order = 
    {  
  
      "`", "~", "!", "@", "#", "$", "%", "^", "&", "*", "(", 
      ")", "-", "_", "=", "+", "[", "{", "]", "}", "|", ";", 
      ":", ",", "<", ".", ">", "/", "?", "0", "1", "2", "3", 
      "4", "5", "6", "7", "8", "9", "A", "a", "B", "b", "C", 
      "c", "D", "d", "E", "e", "F", "f", "G", "g", "H", "h", 
      "I", "i", "J", "j", "K", "k", "L", "l", "M", "m", "N", 
      "n", "O", "o", "P", "p", "Q", "q", "R", "r", "S", "s", 
      "T", "t", "U", "u", "V", "v", "W", "w", "X", "x", "Y",
      "y", "Z", "z"
    
    };
  }
  
  for ( temp.a = 0; temp.a < ( temp.list.size() ^ 2); temp.a ++)
  {

    if ( temp.swap)
    {
    
      temp.a =
      temp.swap = NULL;
      
    }

    if ( (temp.a + 1) == temp.list.size())
      break;

    
    while ( temp.obj1 == temp.obj2)
    {

      temp.obj1 = ( @ temp.list[ temp.a]).substring( temp.start, 1);
      temp.obj2 = ( @ temp.list[ temp.a + 1]).substring( temp.start, 1);
      temp.start ++;
      
      if (( @ temp.list[ temp.a]) == ( @ temp.list[ temp.a + 1]))
        break;

    }

    if ( temp.order.index( temp.obj1) > temp.order.index( temp.obj2))
    {

      temp.swap = temp.list[ temp.a];
      temp.list[ temp.a] = temp.list[ temp.a + 1];
      temp.list[ temp.a + 1] = temp.swap;

    }
    
    temp.obj1 = 
    temp.obj2 = 
    temp.start = NULL;

  }

  return temp.list;
} 


Usage:

PHP Code:

sortBubble( {"a", "0", "aa", "a", "How", "Now", "Brown", "Cow", "?", "A", "a"}) 


would give you this

PHP Code:

{"?","0","A","a","a","a","aa","Brown","Cow","How","Now"} 


[fowlplay4]

When I'm working with arrays and manipulating them I like to use obj.link(), basically removes the need to use a return.

PHP Code:

function onCreated() {
  // Example Array
  temp.arr = "9 8 7 6 5 4 3 2 1".tokenize();
  // Sort
  bubbleSort(temp.arr.link());
  // Array Sorted
  echo(temp.arr);
} 


[salesman]

It would be really cool if we had a built-in sort function that let us specify our own function for comparing objects (similar to c or java sorting methods).

example:

PHP Code:

temp.arr = {3, 4, 1, 22, 14, 42, 1337};
temp.func = function(a, b) { // should return <0 if (a < b), >0 if (a > b), or ==0 if (a == b)
  // do whatever you want to compare a and b
  // ex:
  return a - b;
};

temp.arr.sort(..., temp.func); // would sort the array using my compare function 


I'm not sure if the above is syntactically correct...probably not, but you get the idea.

Actually, I might try to do something like this later when I'm not busy, but built-in would be better!

edit: bubble sort is a terrible sorting algorithm, and if you don't need to specify a specific order, you should stick to built-in sorting which probably uses quicksort or some other O(nlogn) sorting algorithm.

[fowlplay4]

@Sales: http://forums.graalonline.com/forums...47&postcount=6

Also sortbyvalue is champ for typical Graal use.

[12171217]

Wow.. If I had known obj.link() existed, so many of my scripts would be so much simpler.. Does it exist on both client and server?

[fowlplay4]

Originally Posted by 12171217

Wow.. If I had known obj.link() existed, so many of my scripts would be so much simpler.. Does it exist on both client and server?

yeah

[salesman]

Originally Posted by fowlplay4

@Sales: http://forums.graalonline.com/forums...47&postcount=6

Also sortbyvalue is champ for typical Graal use.

Awesome. That's what I was talking about.

[Tigairius]

Originally Posted by fowlplay4

When I'm working with arrays and manipulating them I like to use obj.link(), basically removes the need to use a return.

Technically more efficient to use link() too ... Then again, we're talking about bubble sort here... So I don't think someone using this would care much about efficiency.

[MrOmega]

Originally Posted by Tigairius

Technically more efficient to use link() too ... Then again, we're talking about bubble sort here... So I don't think someone using this would care much about efficiency.

gee thanks...

[Tigairius]

Originally Posted by MrOmega

gee thanks...

You shouldn't really be offended, I know you aren't the one who created the Bubble Sort algorithm. I'm only providing advice, you should be using a better sorting algorithm if you're worried about efficiency. Take a look at the algorithms for Merge, Heap, and Quick sort. Quicksort will work best if the data is not already sorted though.

[MrOmega]

Originally Posted by Tigairius

You shouldn't really be offended, I know you aren't the one who created the Bubble Sort algorithm. I'm only providing advice, you should be using a better sorting algorithm if you're worried about efficiency. Take a look at the algorithms for Merge, Heap, and Quick sort. Quicksort will work best if the data is not already sorted though.

Wasn't offened xP It was sarcasm, which is oftenly lost on the internet