Sorting Order for List using Comparator in Java

import java.util.ArrayList;

import java.util.Collections;

import java.util.Comparator;

import java.util.List;

public class SortingForList {

public static void main(String[] args){

List<String> fruits = new ArrayList<String>();

fruits.add("Pineapple");

fruits.add("1");

fruits.add("3");

fruits.add("2");

fruits.add("9");

fruits.add("apple");

fruits.add("apricot");

fruits.add("Banana");

fruits.add("mango");

fruits.add("melon");        

fruits.add("peach");

    Collections.sort(fruits);

System.out.println("System generated sorting order::" + fruits);

Collections.sort(fruits, new Comparator<String>() {

   public int compare(String o1, String o2) {              

       return o1.compareToIgnoreCase(o2);

   }

});

System.out.println("Customized sorting order:::" + fruits);

}

}

Out put:

================

System generated sorting order::[1, 2, 3, 9, Banana, Pineapple, apple, apricot, mango, melon, peach]

Customized sorting order:::[1, 2, 3, 9, apple, apricot, Banana, mango, melon, peach, Pineapple]

Remove the Duplicate Values from the ArrayList without using Set in Java

mport java.util.List;
import java.util.ArrayList;
public class DupTest {
    public static void main(String[] args){

        List ls = new ArrayList();
        ls.add("1");
        ls.add("3");
        ls.add("5");
        ls.add("1");
        ls.add("8");
         ls.add("3");
        ls.add("9");
    System.out.println("with duplicates:::::"+ls);

    List<String> uniqueList = new ArryaList<>();

    for(String elements : ls){

        if(!uniqueList .contains(elements)){

            uniqueList.add(elements);

        }

    }
    System.out.println("without duplicates::::"+uniqueList);

    }
}


Out Put
======================
with duplicates:::::[1, 3, 5, 1, 8, 3, 9]
without duplicates::::[1, 3, 5, 8, 9]