// 정렬에서 item을 int로 해서 비교하여 할 수 없이 int용 Linked List를 따로 디자인함
package sorting;

public class intLinkedList {
	private intNode head;
	private int numItems;
	public intLinkedList() {
		numItems = 0;
		head = new intNode(-1, null);
	}
	public intNode getNode(int index) {
		intNode curr = head;  // dummy head
		for (int i = 0; i <= index; i++) 
			curr = curr.next;
		return curr; 
	}
	public void add(int index, int item) {
		intNode prev = getNode(index - 1);
		intNode newNode = new intNode(item, prev.next);
		prev.next = newNode;
		numItems++;
	}
	public int len() {
		return numItems;
	}
	public class intNode {
		public int item;
		public intNode next;
		public intNode(int newItem) {
			item = newItem;
			next = null;
		}
		public intNode(int newItem, intNode nextNode) {
			item = newItem;
			next = nextNode;
		}
	}
}