排序、折半查找、字符出现次数

import java.io.File;
import java.util.HashMap;


public class MaxCountWord {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int aa[] = new int[]{1,8,9,0,3,5};
		int[] bb = paoSort(aa);
		for(int a:bb)
		System.out.println(a);
		int c = halfSelect(bb,0);
		System.out.println("--------"+c);
		
	String cc = "helloworld";
//	System.out.println(countNum(cc));

	System.out.println(tongji(cc));
	
	}
//选择排序
	public static int[] selectSort(int[] aa){
		for(int i=0;i<aa.length-1;i++){
			for(int j=i+1;j<aa.length;j++){
				if(aa[i]>aa[j]){
					int tem = aa[i];
					aa[i]=aa[j];
					aa[j]=tem;
				}
			}
		}		
		return aa;
	}
	//冒泡排序
	public static int[] paoSort(int[] aa){
		for(int i=0;i<aa.length-1;i++){
			for(int j=0;j<aa.length-i-1;j++){
				if(aa[j]>aa[j+1]){
					int tem = aa[j];
					aa[j]=aa[j+1];
					aa[j+1]=tem;
				}
			}
		}
		return aa;
	}
	//折半查找
	
	public static int halfSelect(int[] aa,int bb){
		int max=aa.length-1;
		int min=0;
		int half=0;
		while(max>=min){
			half = (max+min)/2;
			if(aa[half]>bb){
				max=half;
			}else if(aa[half]<bb){
				min=half;
			}else 
				return half;
		}
		
		return -1;
	}
	//5.	计算一个字符串中a，b，c...分别包含了几次
	public static HashMap<Character,Integer> countNum(String aa){
		char[] c = aa.toCharArray();
		HashMap<Character, Integer> hm = new HashMap<Character, Integer>();
		for(int i=0;i<c.length;i++){
			if(hm.containsKey(c[i])){
				int tem = hm.get(c[i]);
				tem++;
				hm.put(c[i], tem);				
			}else
				hm.put(c[i], 1);	
		}
		return hm;
	}
	
	//5.	计算一个字符串中a，b，c...分别包含了几次,另一种方法
	public static int[] tongji(String a){
		int[] arr = new int[32];
		for(int i =0;i<a.length();i++){
			int temp =a.charAt(i)-'a';
			arr[temp]++;
		}
		return arr;
	}

}