int Distance(double A[], int N, int M, int packOrder)
{
	//packOrder ==  0  - matrix packed by rows
        //packOrder ==  1  - matrix packed by columns

        //N - number of columns
        //M - number of rows

	//this buffer holds positions of max elements in rows
	int* buffer = (int*)malloc(sizeof(int)*M);

             int jN,k;
	double AMax;

	switch packOrder
	{
		case  0 :
		{
			for(int j =  0 ; j < M; j++)
			{
				jN = j*N;
				AMax =  0 . 0 ;
				buffer[j] =  0 ;
				for(int i =  0 ; i < N; i++)
                                {
					k = i + jN;
					if(fabs(A[k]) > AMax)
					{
						buffer[j] = i;
						AMax = fabs(A[k]);
					}
				}
			}
			break;
		}
		case  1 :	
		{
			for(int j =  0 ; j < M; j++)
			{
				AMax =  0 . 0 ;
				buffer[j] =  0 ;
				for(int i =  0 ; i < N; i++)
                                {
					k = j + i*M;
					if(fabs(A[k]) > AMax)
					{
						buffer[j] = i;
						AMax = fabs(A[k]);
					}
				}
			}
			break;
		}
		default:
		{
			printf("Invalid value supplied for packOrder parameter\n");
			break;
		}
	}

	int jMin, jMax;
	jMin = buffer[ 0 ];
	jMax = jMin;

	for(int j =  1 ; j < M; j++)
	{
		if(jMin < buffer[j])
			jMin = buffer[j];

		
		if(jMax > buffer[j])
			jMax = buffer[j];
	}

            free(buffer);

	return jMax - jMin;
}

for(int j =  1 ; j < M; j++)
	{
		if(jMin < buffer[j])
			jMin = buffer[j];

		
		if(jMax > buffer[j])
			jMax = buffer[j];
	}

for(int j =  1 ; j < M; j++)
	{
		if(buffer[j] < jMin)
			jMin = buffer[j];

		
		if(buffer[j] > jMax)
			jMax = buffer[j];
	}