public class IntList {

	private int[] intArray;
	private int elementCount;

	public IntList(int maxlength) {
		if (maxlength <= 0)
			maxlength = 1;

		intArray = new int[maxlength];
		elementCount = 0;
	}

	public void append(int value) {
		intArray[elementCount] = value;
		elementCount++;
	}

	public void clear() {
		for (int i = 0; i < elementCount; i++)
			intArray[i] = 0;

		elementCount = 0;
	}

	public void copyTo(IntList list) {
		
	}

	public void copyFrom(IntList list) {
		
	}

	public void copyList(IntList list1, IntList list2) {

	}

	public void delete(int index) {
		for (int i = index; i < elementCount; i++)
			intArray[i] = intArray[i + 1];

		elementCount--;
	}

	public void display() {
		for (int i = 0; i < elementCount; i++)
			System.out.println(intArray[i]);
	}

	public boolean equals(IntList list) {
		if (elementCount != list.getCount())
			return false;

		for (int i = 0; i < elementCount; i++) {
			if (intArray[i] != list.get(i))
				return false;
		}

		return true;
	}

	public int get(int index) {
		if (index > elementCount || index < 0) {
			System.out.println("Invalid Index");
			return 0;
		}

		return intArray[index];
	}

	public int getCount() {
		return elementCount;
	}

	public void insert(int value, int index) {
		if (index > elementCount || index < 0)
			System.out.println("Invalid Index");

		for (int i = elementCount; i > index; i--)
			intArray[i + 1] = intArray[i];

		intArray[index] = value;
		elementCount++;
	}

	public void put(int value, int index) {
		if (index > elementCount || index < 0)
			System.out.println("Invalid Index");

		intArray[index] = value;
		elementCount++;
	}

	public void sort() {
		int n = elementCount;
		int temp;
		boolean switched;

		do {
			switched = false;
			for (int i = 0; i < n - 1; i++) {
				if (intArray[i] < intArray[i + 1]) {
					temp = intArray[i];
					intArray[i] = intArray[i + 1];
					intArray[i + 1] = temp;
					switched = true;
				}
			}
			n--;
		} while (switched && n > 0);
	}
	
	public int getMaxCount() {
		return intArray.length;
	}
}