#include <stdio.h>

 /************found************/

 void fun (char *a)

 {  if ( *a )

    {  fun(a+) ;//使用递归进行数组的逆序输出。

 /************found************/

       printf("%c",*a) ;

    }

 }

 void main( )

 {  char s[]="abcd";

    printf("处理前字符串=%s\n处理后字符串=", s);

    fun(s); printf("\n") ;

 }

 #include    <stdio.h>

 #include    <stdlib.h>

 #define    N    8

 typedef  struct list//定义一个结构体

 {  int  data;

    struct list  *next;

 } SLIST;

 void fun( SLIST  *p)

 {  SLIST  *t, *s;

    t=p->next;    s=p;

    while(t->next != NULL)

    {  s=t;

 /**********found**********/

       t=t->next;

    }

 /**********found**********/

    printf(" %d ",*t);//或者t->data

    s->next=NULL;

 /**********found**********/

    free(t);//释放

 }

 SLIST *creatlist(int  *a)

 {  SLIST  *h,*p,*q;      int  i;

    h=p=(SLIST *)malloc(sizeof(SLIST));

    for(i=; i<N; i++)

    {  q=(SLIST *)malloc(sizeof(SLIST));

       q->data=a[i];  p->next=q;  p=q;

    }

    p->next=;

    return  h;

 }

 void outlist(SLIST  *h)

 {  SLIST  *p;

    p=h->next;

    if (p==NULL)  printf("\nThe list is NULL!\n");

    else

    {  printf("\nHead");

       do { printf("->%d",p->data);  p=p->next;  } while(p!=NULL);

       printf("->End\n");

    }

 }

 void main()

 {  SLIST  *head;

    int  a[N]={,,,,,,,};

    head=creatlist(a);//创建头结点

    printf("\nOutput from head:\n");  outlist(head);

    printf("\nOutput from tail: \n");

    while (head->next != NULL){

      fun(head);

      printf("\n\n");

      printf("\nOutput from head again :\n");  outlist(head);

    }

 }