Recursive Balanced Quick Sort - Online Code


A variation of quick sort .it performs very well with time complexity of O(nlogn) always. it assures that in one pass 3 data will be sorted.

Source Code


void qsort(int a[],int,int);
void partition(int a[],int,int,int *);
void print(int *,int);
void swap(int *,int *);

void main()
	int a[30],i,n;
... (login or register to view full code)

To view full code, you must Login or Register, its FREE.

Hey, registering yourself just takes less than a minute and opens up a whole new GetGyan experience.


No comment yet. Be the first to post a comment.