基于动态数组的学习

#include<stdio.h>
#include<stdlib.h>
#include"ISmin.h"
void main()
{
FILE fp;
fp=fopen(“data01.dat”,“r”);
if(fpNULL)
{
printf(“can not file the data01!\n”);
exit(0);
}
int cnt=0;
int *p=(int )malloc(sizeof(int));
while(!feof(fp))
{
fscanf(fp,"%d",p+cnt);
printf("%d\n",(p+cnt));
cnt++;
int *ptr=(int )realloc(p,sizeof(int)(cnt+1));
if(ptrNULL)
{
printf(“can not allocate the enough memory!\n”);
exit(0);
}
p=ptr;
}
double sum;
sum=px(p,cnt);
FILE mp;
mp=fopen(“data2.dat”,“w”);
for(int i=0;i<3;i++)
fprintf(mp,"%d\n",(p+i));
for(int i=0;i<cnt;i++)
printf("%5d",(p+i));
printf(“最小的三个数立方的和为%.2lf\n”,sum);
fprintf(mp,“the result=%.2lf\n”,sum);
printf("\n\n\n");
cz(p,cnt,16);
fclose(fp);
fclose(mp);
free§;
printf("\n文件中存放整数的个数：%d\n",cnt);
system(“pause”);
}
头文件
#include<math.h>
int px(int p,int n)
{
int j,i,temp;
for(i=0;i<n-1;i++)
for(j=0;j<n-i-1;j++)
if((p+j)>(p+j+1))
{
temp=(p+j);
(p+j)=(p+j+1);
(p+j+1)=temp;
}
double sum;
sum=pow((double)p,3.0)+pow((double)(p+1),3.0)+pow((double)(p+2),3.0);
return sum;
//for(i=0;i<n;i++)
//printf("%5d",(p+i));
}
void cz(int p,int num,int x)
{
int bottom=0;
int top=num-1;
int mid;
int flag=0;
int location;
while(bottom<=top)
{
mid=(bottom+top)/2;
if((p+mid)==x)
{
flag=1;
location=mid;
break;
}
else if((p+mid)>x)
top=mid-1;
else
bottom=mid+1;
}
if(flag>0)
printf(“存在要查找的数据！位置是%d\n”,location+1);
else
printf(“不存在要查找的数据！\n”);
}