package benchmark;

public class BubbleSort {
	
	
	void bubbleSort (int[] tab) {
		int i = 0;
		int j = tab.length - 1; /*error : the instruction should be j = tab.length */
		int aux = 0;
		int fini = 0;
		while (fini == 0) {
		    fini = 1;
		    i = 1;
		    while (i < j) {
	            /*@ assert (i > 0 && i < tab.length); */
				if (tab[i-1] > tab[i]) {
				    aux = tab[i-1];
				    tab[i-1] = tab[i];
				    tab[i] = aux;
				    fini = 0;	
				}
				i = i + 1;			
		    }
		    j = j - 1;
		}
		return;
	}
}