public class SLLJoinLists {

    public static void pecati(SLL<Integer> finalList)
    {
        SLLNode<Integer> tmp = finalList.getFirst();
        while(tmp != null)
        {
            System.out.print(tmp.element + " ");
            tmp = tmp.succ;
        }
    }

    public static SLL<Integer> duplikati(SLL<Integer> finalList)
    {
        SLLNode<Integer> i = finalList.getFirst();
        SLLNode<Integer> j = i.succ;

        while(i != null)
        {
            j = i.succ;
            while(j != null)
            {
                if(i.element == j.element)
                {
                    SLLNode<Integer> tmp = j;
                    finalList.delete(tmp);
                }

                j = j.succ;
            }
            i = i.succ;
        }
        return finalList;
    }

    public static SLL<Integer> sort(SLL<Integer> finalList)
    {
        SLLNode<Integer> i = finalList.getFirst();
        SLLNode<Integer> j = i.succ;

        while(i != null)
        {
            j = i.succ;
            while(j != null)
            {
                if(i.element > j.element)
                {
                    int k = i.element;
                    i.element = j.element;
                    j.element = k;
                }
                j = j.succ;
            }
            i = i.succ;
        }
        return duplikati(finalList);
    }

    public static SLL<Integer> SLLJoinLists (SLL<Integer>list1, SLL<Integer> list2)
    {
        SLLNode<Integer> tmp1 = list1.getFirst();
        SLLNode<Integer> tmp2 = list2.getFirst();

        SLL<Integer> finalList = new SLL<Integer>();

        while(tmp1 != null)
        {
            finalList.insertLast(tmp1.element);
            tmp1 = tmp1.succ;
        }
        while(tmp2 != null)
        {
            finalList.insertLast(tmp2.element);
            tmp2 = tmp2.succ;
        }

        return sort(finalList);
    }