Java实现二分法.rar

package com.boryou.sortingalgorithm.program.二分法; /** * 二分法插入排序 * 需求分析： * 插入方式同直接插入相似，只是插入的位置的方式不同 */ public class BinaryInsertionSort { public static void main(String[] args) { int[] a={49,38,65,97,76,13,27,49,78,34,12,64,1}; //定义需要排序数组 System.out.println("二分法插入排序前"); for (int i:a){ System.out.print(i+"\t"); } for (int i = 0; i < a.length; i++) { int temp = a[i]; int left = 0; int right = i-1; int mid = 0; while(left<=right){ mid = (left+right)/2; if(temp<a[mid]){ right = mid-1; }else{ left = mid+1; } } for (int j = i-1; j >= left; j--) { a[j+1] = a[j]; } if(left != i){ a[left] = temp; } System.out.println("\n第"+i+"次插入中"); for (int r:a){ System.out.print(r+"\t"); } } System.out.println("\n二分法插入排序后"); for (int i:a){ System.out.print(i+"\t"); } } }