public int maximumGap(int[] num) {
			if (num == null || num.length < 2) {
				return 0;
			}
			for (int b = 0; b < 31; b++) {
				putIntoBuckets(num, b);
				putFromBuckets(num);
			}
			return maximumGapFromSorted(num);
		}