LinkedHashSet迭代不按升序排列？(LinkedHashSet iteration not in ascending order?)

 在以下代码中，如果参数为{1,3,2}，则在while循环中，i为1,3,2。 
 
 我已经在使用LinkedHashSet，为什么订单不是1,2,3？ 我还需要做什么才能按升序进行迭代？ 
 
 无法使用TreeSet因为它在o（log n）时间内add, remove, contains() 。 
 
public static void iterate(int[] num) {
    LinkedHashSet<Integer> set = new LinkedHashSet<Integer>();

    for (int i : num) {
        set.add(i);
    }

    Iterator<Integer> iter = set.iterator();
    while (iter.hasNext()) {
        // WHY IS i THE SAME ORDER AS INSERATION ORDER, NOT ASSENDING ORDER?
        int i = iter.next();
    }
}

In the following code, if the parameter is {1,3,2}, in the while loop, i is 1, 3, 2.
 
I am already using LinkedHashSet, why is the order not 1, 2, 3? What else do I need to do to make the iteration in ascending order?
 
Cannot use TreeSet as it add, remove, contains() in o(log n) time.
 
public static void iterate(int[] num) {
    LinkedHashSet<Integer> set = new LinkedHashSet<Integer>();

    for (int i : num) {
        set.add(i);
    }

    Iterator<Integer> iter = set.iterator();
    while (iter.hasNext()) {
        // WHY IS i THE SAME ORDER AS INSERATION ORDER, NOT ASSENDING ORDER?
        int i = iter.next();
    }
}

原文：https://stackoverflow.com/questions/26910325