字符串数组二分查找(仅限字母组成的字符串)

package algorithm;

import java.util.Arrays;

public class HalfSearch {
    public static void main(String[] args) {
        String[] arr= {"tomato","orange","peach","pear","apple","banana","lemen","pe","p"};
        String query="orange";//需要查找的字符串
        sort(arr,query);
    }
    public static void sort(String[] arr,String query) {
        //冒泡排序（字符串数组）
                for(int i=0;i<arr.length-1;i++) {
                    for(int j=i+1;j<arr.length;j++) {
                        String temp;
                        //如果首字母大小相同，比较长度，小的在前
                        if(arr[i].charAt(0)==arr[j].charAt(0)) {
                            if(arr[i].equals(arr[j])) {
                                continue;//结束当次循环
                            }
                            if(arr[i].length()>arr[j].length()) {
                                temp=arr[j];
                                arr[j]=arr[i];
                                arr[i]=temp;
                                continue;//结束当次循环
                            }
                            int len;
                            if(arr[i].length()<=arr[j].length()) {
                                len=arr[i].length();
                            }else {
                                len=arr[j].length();
                            }
                            //比较首字母后面的每一个进行排序
                            for(int k=1;k<len;k++) {
                                if(arr[i].charAt(k)>arr[j].charAt(k)) {
                                    temp=arr[j];
                                    arr[j]=arr[i];
                                    arr[i]=temp;
                                    continue;
                                }
                            }
                        }else {
                            //首字母不相等常规排序交换
                            if(arr[i].charAt(0)>arr[j].charAt(0)) {
                                temp=arr[j];
                                arr[j]=arr[i];
                                arr[i]=temp;
                            }
                        }
                    }
                }
                System.out.println(Arrays.toString(arr));
                
                //进行二分查找
                int left=0,right=arr.length-1;
                int middle=(left+right)/2;
                while(!arr[middle].equals(query)) {
                    System.out.println(arr[left]+","+arr[middle]+","+arr[right]);
                    if(arr[middle].charAt(0)>query.charAt(0)) {
                        right=middle;
                    }else if(arr[middle].charAt(0)<query.charAt(0)){
                        left=middle;
                    }else{
                        if(arr[middle].length()<query.length()) {
                            left=middle;
                        }else if(arr[middle].length()>query.length()){
                            right=middle;
                        }else {
                            break;
                        }
                    }
                    middle=(left+right)/2;79                 }
                System.out.println(query+"的位置->"+middle);
    }
}

汉字字符串排序因为有封装类，所以比较简单

package algorithm;

import java.text.Collator;
import java.util.Arrays;

public class Test {
    public static void main(String[] args) {
        //汉字比较大小
        Collator collator= Collator.getInstance(java.util.Locale.CHINA);
        String[] arr= {"中a","美b","俄c","英d","日e"};
        for(int i=0;i<arr.length-1;i++) {
            for(int j=i+1;j<arr.length;j++) {
                String temp;
                if(collator.compare(arr[i],arr[j])>0) {
                    temp=arr[j];
                    arr[j]=arr[i];
                    arr[i]=temp;
                }
            }
        }
        System.out.println(Arrays.toString(arr));
        
    }
}