quicksort c++ stl code example

Example: quick sort predefined function in c++

#include <cstdlib>

//declare compare
int compare(const void* a, const void* b)
{
	const int* x = (int*) a;
	const int* y = (int*) b;

	if (*x > *y)
		return 1;
	else if (*x < *y)
		return -1;

	return 0;
}

//fuction used
qsort(arr,num,sizeof(int),compare);