找数组中最小的K个数

public class Minimum {
public static void main(String[] args) {
int[] source= {23,15,7,9,11,13,45,24,34};
int[] target = new int[source.length];
int[] result=min(4,source,target);
for(int data: result) {
System.out.println(data);
}
}
private static int[] min(int i, int[] source,int[] target) {
for(int j=0;j<source.length-1;j++) {
for(int k=1;k<source.length-1-j;k++) {
if(source[j]>source[k]) {
int temp=source[k];
source[k]=source[j];
source[j]=temp;
}
}
}
for(int l=0;l<4;i++) {
target[l]=source[l];
}

	return target;
}

}