{ link ptr,head,tail; int num,i;
tail=(link)malloc(sizeof(node)); tail->next=NULL; ptr=tail;
printf(\ for(i=0;i<=4;i++) {
scanf(\ ptr->data=num;
head=(link)malloc(sizeof(node)); head->next=ptr; ptr=head; }
ptr=ptr->next; while(ptr!=NULL)
{ printf(\ ptr=ptr->next; }}
============================================================== ¡¾³ÌÐò74¡¿
ÌâÄ¿£ºÁ¬½ÓÁ½¸öÁ´±í¡£ 1.³ÌÐò·ÖÎö£º 2.³ÌÐòÔ´´úÂ룺 #include \ #include \ struct list { int data;
struct list *next; };
typedef struct list node; typedef node *link;
link delete_node(link pointer,link tmp) {if (tmp==NULL) /*delete first node*/ return pointer->next; else
{ if(tmp->next->next==NULL)/*delete last node*/ tmp->next=NULL;
else /*delete the other node*/ tmp->next=tmp->next->next; return pointer; } }
void selection_sort(link pointer,int num)
{ link tmp,btmp; int i,min; for(i=0;i
void main(void)
{ int arr1[]={3,12,8,9,11}; link ptr;
ptr=create_list(arr1,5); selection_sort(ptr,5); }
============================================================== ¡¾³ÌÐò75¡¿
ÌâÄ¿£º·ÅËÉһϣ¬ËãÒ»µÀ¼òµ¥µÄÌâÄ¿¡£ 1.³ÌÐò·ÖÎö£º 2.³ÌÐòÔ´´úÂ룺 main() {
int i,n;
for(i=1;i<5;i++) { n=0; if(i!=1) n=n+1; if(i==3) n=n+1; if(i==4) n=n+1; if(i!=4) n=n+1; if(n==3)
printf(\ } }
============================================================== ¡¾³ÌÐò76¡¿
ÌâÄ¿£º±àдһ¸öº¯Êý£¬ÊäÈënΪżÊýʱ£¬µ÷Óú¯ÊýÇó1/2+1/4+...+1/n,µ±ÊäÈënÎªÆæÊýʱ£¬µ÷Óú¯Êý
1/1+1/3+...+1/n(ÀûÓÃÖ¸Õ뺯Êý) 1.³ÌÐò·ÖÎö£º 2.³ÌÐòÔ´´úÂ룺 main()
#include \ main()
{
float peven(),podd(),dcall(); float sum; int n; while (1) {
scanf(\ if(n>1) break; }
if(n%2==0) {
printf(\ sum=dcall(peven,n); } else {
printf(\ sum=dcall(podd,n); }
printf(\ }
float peven(int n) {
float s; int i; s=1;
for(i=2;i<=n;i+=2) s+=1/(float)i; return(s); }
float podd(n) int n; {
float s; int i; s=0;
for(i=1;i<=n;i+=2) s+=1/(float)i; return(s); }
float dcall(fp,n) float (*fp)(); int n;