4-Arrays and Array Algorithms

一、重点 1，linear search

public int search(int[]arr, int key) { for(int i=0;i<arr.length;i++) { if(key==arr[i]) { return i; } } return -1; }	

2，binary search 针对有序数组

private static int binarySearch(int[] arr, int target) { int left=0; int right=arr.length-1; while(left<=right) { int mid=(left+right)/2; if(target==arr[mid]) { return mid; }else if(target<arr[mid]) { right=mid-1; }else { left=mid+1; } } return -1; }	

分析二分法

二、复习 1, Arrays

2, Random Numbers

3，Inserting an element

Removing an Element