Thread: Is this BUBBLE SORT correct????

Hey im wondering what is wrong with this bubble sort code:

Code:

  while (swapped){
            swapped=0;
            for(i=0; i<unsrtlen-1;i=i+1) {
                if (array[i+1][4]<array[i][4]) {
                  for(j=0;j<5;j++) {
                  help=array[i][j];
                  array[i][j]=array[i+1][j];
                  array[i+1][j]=help;
                  swapped=1;
                }
               j=0;
            }
        }
           unsrtlen=unsrtlen-1;
           }

this is just a part of my program....
I have a 2d array of elements [10][5] and i want to sort the last element on the right hand side in ascending order which means that i have to move a whole line of elements up...
It compiles fine but when i print it in a table i get a bunch of random numbers..
Why is this so????
Any help will be appreciated...

The outermost loop cycles thro' all the elements, from 0 to 9, of the 2D array.
The innermost loop just swaps each of the 5 array elements conditionally.
But it's missing a middle loop - one that compares adjacent elements.

i sort of did figure it out.....
what i didn't tell you is that this program has a max elements of [1000][5] and the input to this program might be 10 lines or 50 or 100 so i have that counter that counts the number of lines which is inputed
I then placed the value of the counter in my printf statement resulting on only the scanned lines to show up in the table and not the empty elements.....
NOW my probem was that the line that has the

Code:

 for(i=0; i<unsrtlen-1;i=i+1) {

the unsrtlen had to be replace with the counter -1 so that it only loops through the number of elements that was scanned.....
thanks for ur help anyway