Quick sort

Concept : Set a benchmark for each sorting , Place the number less than the reference point to the left of the reference point , The number greater than the reference point is placed to the right of the reference point , Make the exchange distance larger .

#include<stdio.h>

int a[100];// Global variables 
int n;// Number of numbers to read 
void quicksort(int left,int right) {
    
	int i,j,t,temp;
	if(left>right) {
    
		return;
	}
	temp=a[left];// Benchmark number 
	i=left;
	j=right;
	while(i!=j) {
    
		// Look from right to left 
		while(a[j]>=temp&&i<j) {
    
			j--;
		}
		// Look from left to right 
		while(a[i]<=temp&&i<j) {
    
			i++;
		}
		if(i<j) {
     // If not, change the position 
		temp=a[i];
		a[i]=a[j];
		a[j]=temp; 
		}
	}
	// The first position, i.e. the reference position, is interchanged with the middle position （ The last exchange of every search ）. 
	a[left]=a[i];
	a[i]=temp;
	// Recursively handle left and right  
	quicksort(left,i-1);
	quicksort(i+1,right);
	return;
}
int main() {
    
	
	scanf("%d",&n);
	for(int i=1; i<=n; i++) {
    
		scanf("%d",&a[i]);
	}
	
	quicksort(1,n);
	for(int i = 1;i<=n;i++)
	{
    
		printf("%d ",a[i]);
	 } 
	 return 0;
}