Single linked list reverse

Single linked list reversed:

 

(1) Algorithm

struct link { int data; struct link *next; }; link reverse(link x) { if( NULL==x ) return NULL; link t=NULL; link r=NULL, y=x; //(0) while(y!=NULL) { t = y->next; //(1) y->next = r; //(2) r = y; //(3) y = t; //(4) } return r; }

(2) Analysis

(0), (1), (2), (3), (4)  correspond to the numbers of codes

the first while loop

-------------------------------------------

(0) r=NULL, y=x

r=NULL    a    --->    b     --->   c   --->  d --> NULL
                |(0)            
                y            

-------------------------------------------

(1) t =y->next

r=NULL    a    --->    b     --->   c   --->  d --> NULL
                | (0)         | (1)  
                y              t 


--------------------------------------------

(2) y->next = r
              
a    --->  NULL            b     --->   c   --->  d --> NULL
|(0)     (2)  |                | (1)  
y                r                t 
 
---------------------------------------------     

  
(3) r = y    
          
a    --->  NULL            b     --->   c   --->  d --> NULL
|(0)        (2)                | (1)  
y                                 t 
|(3)
r

--------------------------------------------- 

(4) y = t
              
a    --->  NULL            b     --->   c   --->  d --> NULL
|(0)        (2)                | (1)  
|                                 t 
|(3)                            | (4)
r                                y

The second while loop (refined):
--------------------------------------------- 
(1) t = y->next
              
a    --->  NULL            b     --->   c   --->  d --> NULL
|                                 |              |(1)
r                                 y              t
                         
--------------------------------------------- 

(2) y->next = r
              
b  --->  a    --->  NULL         c   --->  d --> NULL
|  (2)    |                             |(1)
y          r                             t

--------------------------------------------- 

(3) r = y
              
b  --->  a    --->  NULL         c   --->  d --> NULL
|  (2)                                   |(1)
y                                         t
|  (3)
r

--------------------------------------------- 

(4) y = t
              
b  --->  a    --->  NULL         c   --->  d --> NULL
|  (2)                                   |(1)
|                                          t
|  (3)                                   |(4)
r                                          y

The third while loop(refined):
--------------------------------------------- 

(1) t = y->next
              
b  --->  a    --->  NULL         c   --->  d --> NULL
|                                         |             |(1)
r                                         y             t

later parts are same to the second while loop, at last we can get:
              
d ---> c  ---> b  --->  a    --->  NULL