Bubble Sort Optimized

[EeAA]

I'd like to optimize the bubble sort algorithm. For some reason my algorithm below has worst performance than the original bubble sort. Any ideas what I did wrong? Thank you!

void bubbleSortOptimized(int myArray[], int iLength) 
 {
	 
	
		for(int i=0; i<iLength; i++)
		{ 
			bool swapped = false;
		
			for(int j=0; j<iLength-i-1; j++)
			{
			if(myArray[j]>myArray[j+1])
				{
				swapped = true;
				int temp = myArray[j+1];
				myArray[j+1] = myArray[j];
				myArray[j] = temp;
				}
			}
		// No Swapping, array is sorted
		if(!swapped){ 
		return; 
		} 
		}
}

[tcs]

After each inner loop remember 'j' of your last swapped element and use it as your new termination condition of your outer loop.