快速排序的实现

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

int a[1005];

void quicksort(int l,int r){
    if(l > r) return ;
    int tmp = a[l];
    int i = l;
    int j = r;
    while(i != j){
        while(a[j] >= tmp && i < j)
            j --;
        while(a[i] <= tmp && i < j)
            i ++;
        if(i < j) swap(a[i],a[j]);
    }
    a[l] = a[i];
    a[i] = tmp;
    quicksort(l,i - 1);
    quicksort(i + 1,r);
}

int main(){
    int n;
    cin>>n;
    for(int i = 1; i <= n; i ++) cin>>a[i];
    quicksort(1,n);
    for(int i = 1; i <= n; i ++) cout<<a[i]<<" ";
    cout<<endl;
}

package 快速排序;

import java.util.Scanner;

public class Main {

	static int [] a = new int [1000];
	
	public static void quicksort(int l,int r) {
		if(l > r) return ;
		int i = l;
		int j = r;
		int tmp = a[l];
		while(i != j) {
			while(a[j] >= tmp && i < j) j --;
			while(a[i] <= tmp && i < j) i ++;
			if(i < j) swap(a[i],a[j]);
		}
		a[l] = a[i];
		a[i] = tmp;
		quicksort(l,i - 1);
		quicksort(i + 1,r);
	}
	
    private static void swap(int i, int j) {
		// TODO Auto-generated method stub
		int t = i;
		i = j;
		j = i;
	}

	public static void main(String[] args) {
    	Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		for(int i = 0; i < n; i ++) {
			a[i] = in.nextInt();
		}
		quicksort(0, n - 1);
		for(int i = 0; i < n; i ++) {
			System.out.print(a[i] + " ");
		}
	}
}