Question

suppose values is a sorted ArryList of integers. give a pseudocode that describes how a new value, X, can be inserted in its proper position so that the resulting ArrayList stays sorted

Answer 1

import java.util.ArrayList;

public class AddSorted {

    public static void addSortedOrder(ArrayList<Integer> list, int item) {
        for (int i = 0; i < list.size(); i++) {
            if (item < list.get(i)) {
                list.add(i, item);
                return;
            }
        }
        list.add(item);
    }

    public static void main(String[] args) {
        ArrayList<Integer> list = new ArrayList<>();
        addSortedOrder(list, 3);
        addSortedOrder(list, 9);
        addSortedOrder(list, 1);
        addSortedOrder(list, 2);
        addSortedOrder(list, 7);
        addSortedOrder(list, 5);
        System.out.println(list);
    }
}

procedure addSortedOrder(list, item)
    for i from 0 to size(list)
        if (item < list.get(i))
            list.add(i, item)
            return
        end if
    end for
    list.add(item)
end procedure