0

我在 main 中有一个插入搜索，然后我调用 BinarySearch 方法来搜索数组中已经排序的数字。我尝试编译它我得到错误这里是我的主要插入排序。

public class test5
{
 public static void main(String[] args)
 {

// original order or numbers
System.out.println("Original order of numbers:");
int nums[] = {26, 45, 56, 12, 78, 74, 39, 22, 5, 90, 87, 32, 28, 11, 93, 62, 79, 53, 22, 51};

for(int x = 0; x < nums.length; x++){
System.out.print(nums[x] + " ");
}


// local variables
int unsortedValue; // The first unsorted value
int scan; // used to scan the array
int swapCount = 0;


// the other loop steps the index variable through 
// each subscript in the array, starting at 1. This
// is because element 0 is considered already sorted.
for(int index = 1; index < nums.length; index++)
{
    // The first element outside the sorted subset is
    // nums[index]. Store the value of this elementt
    // in unsortedValue.
    unsortedValue = nums[index];

    // Start the scan at the subscript of the first element
    // into its proper position within the sorted subset.
    scan = index;

    // Move the first element outside the sorted subset
    // into its proper position within the sorted subset.
    while(scan > 0 && nums[scan-1] > unsortedValue)
    {
        nums[scan] = nums[scan -1];
        scan--;

    }

    // Insert the unsorted value in its proper position
    // within the sorted subset.
    nums[scan] = unsortedValue;
    swapCount++;
        }

    //  print out results of swap and swapCount
    System.out.println();
    System.out.println("Insertion sort: ");

    for(int index = 0; index < nums.length; index++){   
            System.out.print(nums[index] + " ");
                        }

    System.out.println();
    System.out.println("The swap count is: " + swapCount);
    BinarySearch(nums);
    }

这是二分查找的方法

public static int BinarySerach(String[] array, String value)
{
Scanner keyboard = new Scanner(System.in);

System.out.print("Enter target: ");
int target = nums.nextInt();
int index = -1;
int left = 0;
int right = nums.length - 1; 
int middle;
while(left <= right){
    middle = (left + right)/2;
    if(nums[middle] == target){
        index = middle;
        break;
    } else if (nums[middle] > target) {
        right = middle - 1;
    }else{
        left = middle + 1;
    }
}
if(index == -1){
    System.out.println("element not found");
}else{
    System.out.println("element found at index " + index);
    }
}

}

我得到的错误是找不到符号。

4

2 回答 2

0

您已经nums在方法中本地声明了您的数组main，因此在其他任何地方都无法访问它，例如您的BinarySearch方法。范围仅在main方法内。

在所有方法之外声明它static，以便可以从任何方法访问它：

public class test5
{
    static int nums[] = {26, 45, 56, 12, 78, 74, 39, 22, 5, 90, 87, 32, 28, 11, 93, 62, 79, 53, 22, 51};

    public static void main(String[] args)
    {
    ...

此外，

  • 您不能调用nextInt( int[]nums)。看起来您打算在Scanner对象上调用它：int target = keyboard.nextInt();
  • 您没有使用任何参数来BinarySearch- 删除它们。还要删除nums您对BinarySearch.
  • 这里可能是一个错字，但是你在这里声明了你的方法BinarySerach而不是BinarySearch.
  • 你没有从你的BinarySearch方法返回任何东西，但你也没有将该方法的返回分配给任何东西；只需制作返回类型void。
于 2013-04-19T22:02:21.297 回答
-1 
import java.io.*;
class BinarySearch{
public static void main(String args[])throws IOException{
InputStreamReader isr=new InputStreamReader(System.in);
BufferedReader br=new BufferedReader (isr);
int a[]={7, 10, 12, 34, 45,51, 60, 78, 81, 92};
int key, low=0, high=a.length-1, mid=0;
System.out.print("Enter the integer to search:");        key=Integer.parseInt(br.readLine());
while(low<=high){
mid=(low+high)/2;
if (key==a[mid])
break;
else if(key<a[mid])
high=mid-1;
else
low=mid+1;
}
if(low<=high)
System.out.println(key+" found at index "+mid);
else
System.out.println(key+" not found");
}
}``
于 2016-03-26T15:40:58.967 回答