Bubble Sort Algorithm

#include <stdio.h>#include <stdlib.h>#include <math.h>#define FALSE 0#define TRUE 1void swap(int *iNumberA, int *iNumberB){	int iIntermediate;	iIntermediate = iNumberA;	*iNumberA = iNumberB;	*iNumberB = iIntermediate;}void bSorta(int *iSortArray[], int iSize){	int isDone 		= FALSE;	int iCounter;		while(isDone=FALSE)	{		isDone		=TRUE;		iCounter	=0;				while(iCounter < iSize)		{			if(iSortArray[iCounter] < iSortArray[iCounter + 1])			{				swap(&iSortArray[iCounter], &iSortArray[iCounter + 1]);				isDone = FALSE;			}			iCounter++;		}	}}int main(int argc, char *argv[]){	int iVals[7];	int iCounter = 0;	printf("Please enter seven values, separated by spaces: ");	while (iCounter < 7)	{		scanf("%d", &iVals[iCounter]);		iCounter++;	}	iCounter = 0;	printf("\n");	bSorta(&iVals, 7);		while (iCounter < 7)	{		printf("%d ", &iVals[iCounter]);	}}