算法day12-----排序改递归

import java.util.Arrays;

public class A6 {
public static void main(String args[]) {
int[] a= {3,7,5,2,0};
System.out.println(Arrays.toString(a));
sort(a,4);
System.out.println(Arrays.toString(a));

}
public static void sort(int[]arr,int k) {
if(k==0) return;
sort(arr,k-1);
int x=arr[k];
int index=k-1;
while(index>-1&&x>arr[index]) {
arr[index+1]=arr[index];
index--;
}
arr[index+1]=x;
}

}