Can search_n be more efficient?

#include "SearchNAux.h"

#include <stdlib.h>
#include <assert.h>

unsigned long SearchItem::sm_cmpCount = 0;

//RandInRange() returns a random integer in the range [rMin, rMax].
//Precondition: RandInRange uses the standard rand() function inside,
//which returns an integer in the range [0, RAND_MAX]. Hence, the range 
//width (rMax-rMin+1) should be in the range [0, RAND_MAX+1].
//If (rMax-rMin) > RAND_MAX, RandInRange will return an integer in the
//range [rMin, rMin+RAND_MAX] instead of [rMin, rMax]
//Note: RandInRange() has better random behavior when (rMax-rMin) < RAND_MAX/2

int RandInRange(int rMin, int rMax)
{
int r = 0;

	assert( rMax > rMin );
	assert( (rMax - rMin) <= RAND_MAX );

	if (rMax > rMin) 
	{
		int range = rMax - rMin + 1;
		r = rand() % range + rMin;
	}

	return r;
}