第三周作业——顺序查找和二分查找

package Text3;
//二分查找算法法
public class HalfSearch {
 public static int halfSearch(int a[], int x) {
  int left,mid ,right;
  left = 0;
  right = a.length - 1;
   mid = (left + right) / 2;
  while (a[mid] != x) {
   if (x > a[mid]) {
    left = mid + 1;
   }
   else if (x < a[mid]) {
    right = mid - 1;
   }
            mid=(left+right)/2;
  }
  return mid;
 }
 public static void main(String[] args) {
  int a[] = {2,4,6,8,10};
  for (int i = 0; i < a.length; i++) {
   System.out.print(a[i] + "  ");
  }
  System.out.println();
  int s = 10;
  int index = halfSearch(a, s);
  System.out.println(s + "该数在数组中位置是第  " + (index+1)+"位");
 }
}

package Text3;
import java.io.*;
import java.util.*;
public class SequelSearch {
 public static void main(String[] args)
 {
  int[] a=new int[]{2,4,6,8,10};
  System.out.print("要查找的数字:  ");
  Scanner sc=new Scanner(System.in);
  int key=sc.nextInt();
  if(search(a,key)==true)
  {
   System.out.println("该数组中有: "+key+"这个数字");
  }
  else
  {
   System.out.println("该数组中没有: "+key+"这个数字");
  } 
 }
  public static boolean search(int[] a,int s)
  { 
     boolean flag=false;
     for(int i=0;i<=a.length-1;i++)
     {
    if(s==a[i])
   {
      flag=true;
   }  
   }
     return flag;
  }
}