Anonymous

	public void insertSort(Object o) {
		if (IsEmpty())
			insert(o);
		
		if (contains(o)) {
			//SOLLEVA ECCEZIONE
			return;
		}
		
		if (((Comparable) o).compareTo(startnode.info) < 0) {
			startnode = new Node (o, startnode);
			return;
		}
		
		Node currnode = startnode;
		while ((((Comparable) currnode.info).compareTo(o) > 0) 
				&& (currnode.next != null)) {
			currnode = currnode.next;
			continue;
		}
		currnode.next = new Node(o,currnode);
		/*Node currnode = startnode.next;
		while (currnode != null) {
			if	((((Comparable) o).compareTo(precnode.info) > 0) || 
				 (((Comparable) o).compareTo(currnode.info) < 0)) {
				
				precnode.next = new Node(o,currnode);
				return;
			}
			precnode = precnode.next;
			currnode = currnode.next;
		}
		precnode.next = new Node(o);*/
	}