Pitel

public static final int[] Bubblesort(int[] pole) {	int pom;	for (int i = 2; i < pole.length; i++) {		for (int j = n; n > i; n--) {If (pole[j-1]>pole[j]) {			pom=a[j-1];			a[j-1]=a[j];			a[j]=pom;			}		}	}	return pole;}