输入字符串数组 ,转化为整数数组进行排序
public class StringQuicksort {
public static void main(String[] args) {
String str = "10 9 30 15 20 90 100 52 64 80";
String[] strArr = str.split(" ");
int[] arr = new int[strArr.length];
for (int i = 0; i < strArr.length; i++) {
int number = Integer.parseInt(strArr[i]);
arr[i] = number;
}
quickSort(arr, 0, arr.length - 1);
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
}
public static void quickSort(int[] arr, int i, int j) {
if (i > j) {
return;
}
int start = i;
int end = j;
int baseNumber = arr[i];
while (start != end) {
while (baseNumber <= arr[end] && start < end) {
end--;
}
while (baseNumber >= arr[start] && start < end) {
start++;
}
if (start < end) {
int temp = arr[end];
arr[end] = arr[start];
arr[start] = temp;
}
}
arr[i] = arr[start];
arr[start] = baseNumber;
quickSort(arr, i, end - 1);
quickSort(arr, end + 1, j);
}
}