<span style="white-space:pre">		</span>10.1.1处理数组

<span style="white-space:pre">		</span>
		double[] myList = new double[10];
		//1）使用输入值初始化数组
		java.util.Scanner input new java.util.Scanner(System.in);
		System.out.println("Enter " +myList.length+"values");
		for(int i = 0;i< myList.length; i++)
			myList[i] = input.nextDouble();
		//2)使用随机数初始化数组
		for(int i = 0;i<myList.length;i++)
			myList[i] = Math.random()*100;
		//3)打印数组
		for（int i = 0;i <myList.length;i++)
			System.out.print(myList[i] + " ");
		//4）对所有元素求和并打印
		double sum = 0;
		for（int i = 0;i <myList.length;i++)
			sum += myList[i];
		System.out.print(sum );
		//5)找出最大元素的最小下标
		double max = myList[0]；
		int  indexOfMax = 0;
		for（int i= 1 ； i<myList.length; i ++){
			if (myList[i] > max){
			max = myList[i];
			indexOfMax = i;
			}
		}
		//6随意打乱元素顺序
		for (int i = 0; i <MyList.length; i++){
			int index = (int)(Math.random() * myList.length);
			double temp = myList[i];
			myList[i] = myList[index];
			myList[index] = temp;
		}
		//7移动元素
		double temp = myList[0];
		for (int i = 1;i <MyList.length;i++){
			myLIst[i- 1] = myList[i];
		}
		myList[myList.length -1] = temp;
	//10.1.2查找
		//1）线性查找
		public class LinearSearch{
			public static void main(String[]
 args){
		   int[] list = new int{1,4,4,2,5,-3,6,2};
		   int a = linearSearch(list,4);// returns 1
		   int b = linearSearch(list,-4);// returns -1
		   int c = linesrSearch(list,-3);// returns 5
		   }
		    public static int lnearSearch(int[] list ,int key){
			    for(int = 0; i <list.length;i++){
				    if(key == list[i]
					    return i;
				}
				return -1;
			}	 
		
	}

public class BinarySearch{
			public static void main(String[]
args){      	int[] list = {2,4,7,10,11,45,50,59,60,66,69,70,79};
				 int a = binarySearch(list,2);//Returns 0
				 int b = binarySearch(list,11);//Returns 4
				 int c = binarySearch(list,12);//returns -6
				 int d = binarySearch(list,1)://Returns -1
				 int e = binarySearch(list,3); //Returns -2
			}
				 
			public static  int binarySearch(int[] list,int key){
				int low = 0;
				int high = list.length-1;
				while(high >= low){
					int mid = (low+high)/2;
					if(key<list[mid])
						high = mid - 1;
					else if (key==list[mid])
					return mid;
					else 
						low = mid +1;
				}
				return  -low-1;
			}
		}

<span style="white-space:pre">	</span>//1）插入排序
		public static void sort(int[] a){
			 for(int i = 1; i < a.length;i++){
				int temp = a[i];
				int j;
				for ( j = i -1; j>= 0;j--){
					if(a[j] > temp)
						a[j+1] = a[j];
					else
						break;
				}
			a[j +1] = temp;
			}
	}
	//2）选择排序
	public static void xuanZheSort(int[] a){
		for(int i =0; i < a.length -1;i++){
			int min = a[i];
			int minOfIndex = i;
			for (int j = i + 1; j< a.length;j++){
				if (min > a[j]){
					min = a[j];
					minOfIndex = j;
				}
			}
			if(minOfIndex != i){
				a[minOfIndex] = a[i];
				a[i] = min;
			}
		}
	}
	//3）冒泡排序
	public static void bubbleSort(int[] a ){
		for(int x= 0;x <a.length-1;x++){
			for(int y = 0;y <a.length -x -1;y++){
				//-x 让每次比较的元素减少，-1：是避免下标越界；
				if (a[y] > a[y+1]){
					swap(a,y,y+1);
				}
			}
		}
	}
	public static void swap(int[] arr, int a ,int b){
		int temp = arr[a];
		arr[a] = arr[b];
		arr[b] = temp;
	}

java.util.Scanner input = new java.util.Scanner(System.in);
	System.out.println("Enter" + matrix.length+ "rows and"+matrix[0].length + "colums");
	for(int row =0;row<matrix.length; row++){
		for(int column = 0;column <matrix[row].length;column++)
			matrix[row][column];
	}
	//2)使用随机数初始化数组
	for(int row =0;row<matrix.length; row++){
		for(int column = 0;column <matrix[row].length;column++)
			matrix[row][column] = (int)(Math.random() *100);
	}
	//3)打印数组
	for(int row =0;row<matrix.length; row++){
		for(int column = 0;column <matrix[row].length;column++)
			System.out.print(matrix[row][column] + "\t");
		System.out.println();
	}
	//4)求所有元素的和
	int total = 0；
	for(int row =0;row<matrix.length; row++){
		for(int column = 0;column <martix[row].length;column++)
			  total += matrix[row][column];
		System.out.println(total);
	}
	//5)对数字安列求和
	for(int column = 0;column <matrix[0].length;column++ ){
		int sum = 0;
		for(  int row =0;row<matrix.length; row++)
			sum += martix[row][column];
		System.out.println（“sum of column " + column + "is" +sum);
	}
	//6)哪一行的和最大
	int maxRow = 0;
	int indexOfMaxRow = 0;
	for(int column = 0 ;column<matrix[0].length;column++){
		maxRow += matrix[0][column];
	for(int row =1;row <matrix.length;row++){
		int totalOfThisRow = 0;
		for(int column =0;column<matrix[row].length;column++){
			totalOfThisRow += matrix[row][column];
			if (totalOfThisRow > maxRow){
				maxRow = totalOfThisRow;
				indexOfMaxRow = row;
			}
		}
		System.out.println("Row" + indexOfMaxRow+"has the maximum sum of " + maxRow);