binarysearch.java

来自「Binary Search in Java. This can read in 」· Java 代码 · 共 63 行

//------------------------------------------------------------------------------
//Programmer:	Jun Cui 
//Date:         08.05.2008
//Assignment:   IT214 Java Lab 6 
//Software:     Netbeans IDE 6.0
//------------------------------------------------------------------------------

package pbinarysearch;

/**
 *
 * @author CUIJ2
 */
public class BinarySearch {
    public void selectSort (String[] numbers)
    {
        
        int smallest = 0;                       //used for comparisons
        int newSmallest = 0;                    //used for comparisons
    
        for (int i = 0; i < numbers.length-1; i++)  
        {
           smallest = i;       //first number is set to smallest
           newSmallest = i;    // new smallest is reset too
           for (int j = i + 1; j < numbers.length; j++)
           {   
                if (numbers[j].compareTo(numbers[newSmallest]) <= 0)
                    newSmallest =j;         //finds the smallest in array                
           }
 //compare new smallest with smallest and swap if so
           //numbers[newSmallest]is alphabetically less than numbers[smallest] 
           if (numbers[newSmallest]. compareTo(numbers[smallest]) < 0)       
           {        
                String temp= numbers[smallest];		//swap 
                numbers[smallest]=numbers[newSmallest];    //swap 
                numbers[newSmallest]= temp;		//swap                 
           }
        }
    }
    
    public String search(String[]numArray, String wanted)
    {
        int left = 0;
        int right = (numArray.length - 1);        
        int middle;       
        
        while(left <= right)
        {
            middle = (left + right)/2;
            if (numArray[middle].equals(wanted))
                return "Found at " + middle;
            else 
                if(numArray[middle].compareTo(wanted) < 0)
                    left = middle + 1;
                else 
                    //numArray[middle]is alphabetically greater than wanted
                    if(numArray[middle].compareTo(wanted) > 0)
                        right = middle - 1;                        
        }
        return "Sorry! Can not find the string!";
    }
}