public static int getLCM(int[] numArr) {
		QuickSorter qc = new QuickSorter();
		qc.sort(numArr);
		int length = numArr.length;
		int greatInt = numArr[length - 1];
		int lcm = greatInt;

		while(true) {
			int count = 0;
			for(int i:numArr) {
				while(lcm%i != 0) {
					lcm = lcm + greatInt;
					count = 0;
				}
				count++;
			}
			if(numArr[count-1] == numArr[length-1]) {
				return lcm;
			}
		}

	}