School Commit Init

Anul 1/Semestrul 1/Programare in C/L5/quicksort.c

@@ -0,0 +1,47 @@
+#include<stdio.h>
+void swap(int *a,int *b){
+	int t=*a;
+	*a=*b;
+	*b=t;
+}
+
+int partitions(int array[],int low,int high){
+	int pivot = array[high];
+	int i=low-1;
+	for(int j = low;j<high;j++){
+		if(array[j]<=pivot){
+			i++;
+			swap(&array[i],&array[j]);
+			
+		}
+
+	}
+	swap(&array[i+1],&array[high]);
+	return i+1;
+}
+
+void quicksort(int array[],int low,int high){
+	if(low<high){
+		int pi =partitions(array,low,high);
+		quicksort(array,low,pi-1);
+		quicksort(array,pi+1,high);
+	}
+}
+
+void printArray(int array[],int size){
+	for(int i=0;i<size;++i){
+		printf("%d ",array[i]);
+	}
+	printf("\n");
+}
+int main(){
+	int data[]={8,7,2,1,0,9,6};
+	int n=sizeof(data)/sizeof(data[0]);
+	printf("Unsorted Array\n");
+	printArray(data,n);
+	quicksort(data,0,n-1);
+	printf("Sorted array in ascending order: \n");
+	printArray(data,n);
+	return 0;
+
+}