Java program to remove duplicate elements from an arraylist without using collections (without using set)

package javaprgms;

import java.util.ArrayList;

public class RemoveDuplicates {

            public static void main(String[] args){

                        ArrayList<Object> al = new ArrayList<Object>();

                        al.add("java");

                        al.add('a');

                        al.add('b');

                        al.add('a');

                        al.add("java");

                        al.add(10.3);

                        al.add('c');

                        al.add(14);

                        al.add("java");

                        al.add(12);

                        System.out.println("Before Remove Duplicate elements:"+al);

                        for(int i=0;i<al.size();i++){

                                    for(int j=i+1;j<al.size();j++){

                                                if(al.get(i).equals(al.get(j))){

                                                            al.remove(j);

                                                            j--;

                                                }

                                    }

                        }

                        System.out.println("After Removing duplicate elements:"+al);

            }

}

Output:

Before Remove Duplicate elements:[java, a, b, a, java, 10.3, c, 14, java, 12]

After Removing duplicate elements:[java, a, b, 10.3, c, 14, 12]