快速排序题目的解法(初学者,就硬做)
import java.io.BufferedInputStream;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
while (sc.hasNext()){
String str=sc.nextLine();
String[] ret=str.split(",");
int[] arr=new int[ret.length];
for(int i = 0;i < ret.length;i++){
arr[i] = Integer.parseInt(ret[i]);
}
//
quickSort(arr,0, ret.length-1);
//
System.out.print("["+arr[0]);
for (int i = 1; i < arr.length; i++) {
System.out.print(", "+arr[i]);
}
System.out.print("]");
}
}
//分而治之的思想
public static void quickSort(int[]arr,int left,int right){
if(left>=right) return;
int x= arr[(right+left)/2],i=left-1,j=right+1;
while (i do {
i++;
}while (arr[i] do {
j--;
}while (arr[j]>x);
if(i int t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
}
quickSort(arr,left,j);
quickSort(arr,j+1,right);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
while (sc.hasNext()){
String str=sc.nextLine();
String[] ret=str.split(",");
int[] arr=new int[ret.length];
for(int i = 0;i < ret.length;i++){
arr[i] = Integer.parseInt(ret[i]);
}
//
quickSort(arr,0, ret.length-1);
//
System.out.print("["+arr[0]);
for (int i = 1; i < arr.length; i++) {
System.out.print(", "+arr[i]);
}
System.out.print("]");
}
}
//分而治之的思想
public static void quickSort(int[]arr,int left,int right){
if(left>=right) return;
int x= arr[(right+left)/2],i=left-1,j=right+1;
while (i
i++;
}while (arr[i]
j--;
}while (arr[j]>x);
if(i
arr[i] = arr[j];
arr[j] = t;
}
}
quickSort(arr,left,j);
quickSort(arr,j+1,right);
}
}
全部评论
y总弟子?
送花
回复
分享
相关推荐
05-15 07:29
重庆邮电大学 电子信息类 点赞 评论 收藏
转发
04-03 23:15
中国石油大学(华东) 计算机类 点赞 评论 收藏
转发