void calc_mode(){
	int*	count = 0;
	int		size;
	int		index;
	list*	modes = new list;   //custom list 
	int*	position;
    int		min;
	int		max_count;


		free(count);
		min = find_min();
		size = (find_max() - min)+1;
		count = (int*) malloc(size * sizeof(int) );
		for(index=0;index<size;index++)
			*(count+index) = 0;

		if(data->home()){
			do{
            	*(count + *( (int*) data->get_data() ) - min) += 1;
			}while(data->next());
		}
		delete modes;
		modes = new list;
		max_count = 0;
		for(index=0;index<size;index++){
			if ( *(count+index) > max_count){
				delete modes;
				modes = new list;
				position = (int*) malloc(sizeof(int));
				*position = index+min;
				modes->add_data(position);
				max_count = *(count+index);
			}
			else if ( *(count+index) == max_count){
				position = (int*) malloc(sizeof(int));
				*position = index+min;
				modes->add_data(position);
			}
		}


	printf("The most reocurring numbers are: \n");
	if(modes->home()){
		do{
			printf("\t%d\n",*( (int*) modes->get_data() ) );
		}while(modes->next());
	}
	printf("Each of these numbers occur %d times\n",max_count);

	//BEGIN TEMPORARY OUTPUT TO TEST FUNCTIONALITY
	FILE*	temp;
	temp = fopen("count.txt","w");
	for(index=0;index<size;index++)
		fprintf(temp,"[%d]: %d\n",index+min,*(count+index));
	fclose(temp);
	//END TEMPORARY OUTPUT

	delete modes;
	free(count);
}