常用的算法

• 冒泡算法

package com.example.ajaxdemo.springmvc;

public class Algorithm {
    public static void main(String[] args) {
        int[] a = {1,3,4,2,5,9,7,0};
        for(int b=a.length-1;b>0;b--){
            int c ;
            for(int d=0;d<a.length-1;d++){
                if (a[d]>a[d+1]){
                  c=a[d+1];
                  a[d+1]=a[d];
                  a[d]=c;
                }
            }

        }
        for (int r=0;r<a.length;r++){
            System.out.println(a[r]);
        }


    }
}

• 选择排序

 public static void main(String[] args) {
        int[] a = {1,3,4,2,5,9,7,0};

        for (int b=0;b<a.length;b++){
            int temp = 0;
            for(int ac =0;ac<a.length-1;ac++){
                if (a[ac]>a[ac+1]){
                    temp =a[ac];
                    a[ac]=a[ac+1];
                    a[ac+1]=temp;
                }
            }

        }
        for (int g=0;g<a.length;g++){
            System.out.println(a[g]);
        }


    }

• 统计计数算法

 public static void main(String[] args) {
        int[] a = {1,1,3,4,2,2,2,2,5,9,9,9,9,9,7,0};
        int[] b =new int[a.length+1];
        //首先要复制一个数组注意长度不能低于原数组
        System.arraycopy(a,0,b,0,a.length);
        HashMap<Object, Object> maptest = new HashMap<>();
        for(int h=0;h<b.length;h++){
            int i = b[h];
            int c =0;
            for(int t=0;t<a.length;t++){
                if(a[t]==i){
                    ++c;
                }
            }
            maptest.put(i,c);
        }
        for (Map.Entry<Object, Object> objectObjectEntry : maptest.entrySet()) {
            System.out.println(objectObjectEntry);
        }


    }