插入排序的递归实现

import java.math.BigInteger;
import java.util.*;

public class T4 {

	static void insertSort(int[] arr, int k){
		
		if(k == 0) {
			return;
		}
		insertSort(arr, k - 1);
		int x = arr[k];
		int index = k - 1;
		while(index >= 0 && x < arr[index]) {
			arr[index + 1] = arr[index];
			index--;
		}
		arr[index + 1] = x;
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int[] arr = {2,3,1,4,41,5,0};
		
		T4.insertSort(arr, 6);
		
		for(int i : arr) {
			System.out.println(i);
		}
	
	}

}