# Original code:
void f(int[] array){
	boolean swapped = true;
	for (int i = 0; i < array.length && swapped; i++){
		swapped = false;
		for (int j = 0; j < array.length-1-i; j++) {
			if (array[j] > array[j+1]) {
				int temp = array[j];
				array[j] = array[j+1];
				array[j+1]= temp;
				swapped = true;
			}
		}
	}
}

Prediction: sort (98.54%)


## Adversarial1:
void f(int[] mstyleids){
	boolean swapped = true;
	for (int i = 0; i < mstyleids.length && swapped; i++){
		swapped = false;
		for (int j = 0; j < mstyleids.length-1-i; j++){
			if (mstyleids[j] > mstyleids[j+1]) {
				int temp = mstyleids[j];
				mstyleids[j] = mstyleids[j+1];
				mstyleids[j+1]= temp;
				swapped = true;
			}
		}
	}
}

Prediction: get (99.99%) 


## Adversarial2:
void f(int[] possiblematches){
	boolean swapped = true;
	for (int i = 0;
		i < possiblematches.length && swapped; i++){
		swapped = false;
		for (int j = 0; j < possiblematches.length-1-i; j++){
			if (possiblematches[j] > possiblematches[j+1]){
				int temp = possiblematches[j];
				possiblematches[j] = possiblematches[j+1];
				possiblematches[j+1]= temp;
				swapped = true;
			}
		}
	}
}

Prediction: indexOf (86.99%)