void intersection(Menge a) {  
		int j = 0;
		int[] tmp;
		if(this.elements.length >= a.elements.length){
			tmp = new int[this.elements.length];
			
			for (int i = 0; i < this.elements.length; i++) {
				if(isElement(a.elements[i])) {
					tmp[i] = a.elements[i];
					j++;
				}
			}
		} else {
			tmp = new int[a.elements.length];
			for (int i = 0; i < a.elements.length; i++) {
				if(isElement(a.elements[i])) {
					tmp[i] = a.elements[i];
					j++;
				}
			}
			
		}
//UPDATED BY EEE
		this.elements = new int[j];
		
		for (int k = 0; k < j; k++) {
			this.elements = tmp[k];
		}
//END OF UPDATE

		
	}