BubbleSort for array In C

BubbleSort for array In C.c

#include <stdio.h>

void fprintArray(int arrayi[], int arrayLength);

int main()
{

    //counters to use in all loops
    int i,j;

    //make an array
    int arrayLength = 15;
    int myArray[arrayLength];

    for(i=0;i<arrayLength;i++)
    {
        myArray[i]= (rand()%30)+1;
    }

//print generated array
    fprintArray(myArray, arrayLength);


//sort the array

/*
Bubble sort
//Small number bubbles up to end. and this done one by one for all members results in sorted array.

//  First thing to do.
Check first element with next, swap if second>first.
check second with next, swap if third>second.
...     ...     ...
*/


//this loop runs the comparison for all elements
    for(j=0;j<arrayLength;j++)  //run whatever is inside arrayLength times.
    {

    //this loop does the compare and swap
        for(i=0;i<(arrayLength-1)-j;i++)    //when comparing next guy is considered by +1, so loop should run length -1.
                                        // -j means that the last j guys are already sorted, no need to compare.
        {
            if(myArray[i]>myArray[i+1]) //compare to next guy and if next guy is bigger, swap.
            {
                int temp;
                temp = myArray[i+1];
                myArray[i+1] = myArray[i];
                myArray[i] = temp;
            }
        }
    }

//print sorted array
    fprintArray(myArray, arrayLength);


    return 0;
}



//Function printArray

void fprintArray(int arrayi[],int arrayLength)
{
    int i;

        for(i=0;i<arrayLength;i++)
    {
        printf(" %d",arrayi[i]);
    }
    printf("\n");
}