Create a program for an unsorted linked list that removes duplicate and sort it in ascending order. 

```
package fp1;

/*
 * To change this template, choose Tools | Templates and open the template in
 * the editor.
 */

public class FP1 {

    public static void main(String[] args) {

        final int[] C = { 6, 4, 2, 5, 5, 3, 8, 7, 7, 1, 9 };

        int current = C[0];
        boolean found = false;

        for (int i = 0; i < C.length; i++) {
            if (current == C[i] && !found) {
                found = true;
            } else if (current != C[i]) {
                System.out.print(" " + current);
                current = C[i];
                found = false;

                System.out.print(" " + current);

                int min;
                {
                    // Assume first element is min
                    min = i;
                    for (int j = i + 1; j < C.length; j++) {
                        if (C[j] < C[min]) {
                            min = j;

                        }
                    }
                    if (min != i) {
                        final int temp = C[i];
                        C[i] = C[min];
                        C[min] = temp;
                    }
                    System.out.print(C[i]); // I print the in ascending order
                }
            }
        }
    }
}

```