package ca.pfv.spmf.algorithms.sort;
/* This file is copyright (c) 2008-2013 Philippe Fournier-Viger
* 
* This file is part of the SPMF DATA MINING SOFTWARE
* (http://www.philippe-fournier-viger.com/spmf).
* 
* SPMF is free software: you can redistribute it and/or modify it under the
* terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any later
* version.
* 
* SPMF is distributed in the hope that it will be useful, but WITHOUT ANY
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
* A PARTICULAR PURPOSE. See the GNU General Public License for more details.
* You should have received a copy of the GNU General Public License along with
* SPMF. If not, see <http://www.gnu.org/licenses/>.
*/
/**
 *  Class for testing and debugging the selection algorithms (for developers only).
 * @author Philippe Fournier-Viger
 */
class MainTestSelect {
    /** Test method */
    public static void main( String[ ] args ) {
        int[ ] input = { 546, 743, 5, 394,  4, 11, 42 };
        System.out.println(Select.randomizedSelect(input, 0));
        System.out.println(Select.randomizedSelect(input, 1));
        System.out.println(Select.randomizedSelect(input, 2));
        
        // Test for searching only a subarray from position  0 to position 3,
        // that is in the sub-array  { 546, 743, 5, 394}
        input = new int[]{ 546, 743, 5, 394,  4, 11, 42 };
        System.out.println(Select.randomizedSelect(input, 0, 0, 3));
        System.out.println(Select.randomizedSelect(input, 1, 0, 3));
        System.out.println(Select.randomizedSelect(input, 2, 0, 3));
    }
}
