DataSet

import java.util.Iterator;
import java.util.Scanner;
import java.util.Vector;
/**
 *
 * @author Tibi
 */
public class DataSet {

    public Vector vector;

    public DataSet() {
    vector = new Vector();
    }

    public DataSet( DataSet obj ) {
        vector = obj.vector;
    }

    public void fill() {
        Scanner sc = new Scanner( System.in );
        System.out.println( "Adja meg az input hosszat!" );
        int num = sc.nextInt();
        int x;

        for( int i = 0; i < num; i++ ) {
            x = sc.nextInt();
            vektor.add( new Data( x ) );
        }
    }
    @Override
    public String toString() {
        String s = new String();
        Iterator it = iterator();

        while( it.hasNext() ) {
            s += ( (Data)it.next() ).a + " ";
        }
        return s;
    }

}


/**
 *
 * @author Tibi
 */
public class Data implements Comparable {
    public Integer a;

    public Data(){
        a = 0;
    }

    public Data( Integer aa ) {
        a = aa;
    }

    public Data( Data obj ) {
        a = obj.a;
    }

    @Override
    public int compareTo( Object obj ) {
        Data tmp = (Data) obj;

        if( a > tmp.a ) {
            return 1;
        }
        if( a < tmp.a ) {
            return -1;
        }
        return 0;
    }

    @Override
    public String toString() {
        return "a: " + a;
    }
}



import java.util.Collections;
import java.util.Scanner;

public class SortAndSearch {
    public static void main( String[] args ) {
        DataSet ds = new DataSet();
        ds.fill();

        System.out.println( ds.toString() );
        //Rendezzük a ds obejektumunkat.
        Collections.sort( ds );
        System.out.println( ds.toString() );
    }
}