Делливи со најмал елемент

package Lista_DelliviSoMinElemOdNiza;

import java.util.Scanner;

public class Divide {

    public static void pecati(Array<Integer> niza)
    {
        for(int i=0; i<niza.getLength()-1; i++)
        {
            System.out.print(niza.get(i) + " ");
        }
        System.out.print(niza.get(niza.getLength()-1));
    }

    public static int minElement(SLL<Integer> list)
    {
        SLLNode<Integer> tmp = list.getFirst();

        int mini = list.getFirst().element;

        while(tmp != null)
        {
            if(tmp.element.compareTo(mini)==-1)
            {
                mini=tmp.element;
            }
            tmp = tmp.succ;
        }
        return mini;
    }

    public static Array<Integer> transform (SLL<Integer> list)
    {
        Array<Integer> niza = new Array<Integer>(list.length());

        SLLNode<Integer> tmp = list.getFirst();

        int i=0;
        int min = minElement(list);
        while(tmp != null)
        {
            if(tmp.element % min == 0)
            {
                niza.set(i, tmp.element);
            }

            tmp = tmp.succ;
            i++;
        }
        return niza;
    }

    public static void main(String[] args) {

        Scanner s = new Scanner(System.in);

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

        System.out.println("Vnesi n: ");
        int n = s.nextInt();

        System.out.println("\nVnesi elementi vo listata: ");
        for(int i=0; i<n; i++)
        {
            list.insertLast(s.nextInt());
        }

        System.out.println("Od lista vo niza: ");
        Array<Integer> novaNiza = transform(list);
        pecati(novaNiza);

        //System.out.println("Min element e: "+ minElement(list));

    }
}