⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 function.c~

📁 图像置乱代码
💻 C~
字号:
#include <fcntl.h>
#include <sys/file.h>
#include <tina/all_tina.h>
/*_______________________ runerror __________________________*/
void runerror(error_text)
char error_text[];
{
/*
        void exit();
*/

        fprintf(stderr, "Run-time fatal error ... \n");
        fprintf(stderr, "%s\n", error_text);
        fprintf(stderr, "... now exiting to system.\n");
        exit(1);
}
/*_____________________ int_vector _________________________*/
int *int_vector(int n)
{
    int *v;
     
    v = (int *)malloc((unsigned) (n*sizeof(int)));
    if(!v) runerror("alloaction failure in int_vector()");
    return v;
}/*_________________________ free_int_vector ____________________*/ 
void free_int_vector(int *v)
{
    free((int*) v);
}/*_____________________ float_vector _________________________*/
float *fl_vector(int n)
{
    float *v;
     
    v = (float *)malloc((unsigned) (n*sizeof(float)));
    if(!v) runerror("alloaction failure in fl_vector()");
    return v;
}/*_________________________ free_int_vector ____________________*/ 
void free_fl_vector(float *v)
{
    free((float*) v);
}void nrerror(char error_text[])
{
	fprintf(stderr,"Numerical Recipes run-time error...\n");
	fprintf(stderr,"%s\n",error_text);
	fprintf(stderr,"...now exiting to system...\n");
	exit(1);
}/*-------ascending numerical order-------*/void sorting(data,n)
float data[];	int n;
{
	int i, j, min;		float dmin;

	for(i=0; i<n-1; i++)
	{
		min = i;			dmin = data[i];
		for(j=i+1; j<n; j++)
			if(data[j]<dmin)				{				min = j;					dmin = data[j];			}
		data[min] = data[i];			data[i] = dmin;	
	}
}int get_median(data,n)float data[];   int n; {	int i; 	float sorted[n];	int median = 0;	for(i = 0;i < n;i ++)		sorted[i] = data[i];	sorting(sorted,n);	if(fmod(n,2) == 1)		median = sorted[((n-1)/2)];	else 		median = ((sorted[n/2] + sorted[n/2-1])/2);	//printf("%d\n",median);	return median;}int get_mode(data,n)float data[]; int n;{	int i,t,max;	int gray[256];	int freqgray;	for(i = 0; i < 256; i ++)		gray[i] = 0;	for(i = 0; i < n; i ++)	{		t = (int)data[i];		gray[t] ++;	}	max = gray[0];	freqgray = 0.0;	for(i = 1; i < 256; i ++)		if(gray[i] > max)		{			max = gray[i];			freqgray = i;		}	//printf("%d,%d\n",max,freqgray);	return freqgray; }

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -