private static Node insertIntoList(Node h, Node n){
		if(n.v <= h.v){
			n.next = h;
			return n;
		}
		Node prev = h;
		Node curr = h.next;
		while(curr!=null){
			if(n.v <= curr.v){
				prev.next = n;
				n.next = curr;
				break;
			}
			prev = curr;
			curr = curr.next;
		}
		if(curr==null){
			prev.next = n;
			prev.next.next = null;
		}
		return h;
	}