Seeking greatest common divisor by the method of dividing

1#include <stdio.h>2 voidSortint*PA,int*PB) {//A , B is arranged in order from large to small (using pointers to achieve "bidirectional" delivery)3     intT;4     if(*pa<*pb) {5t=*pa;*pa=*pb;*pb=T;6     }7 }8 intGcd_1 (intAintb) {//seeking greatest common divisor with the method of dividing9     intC;Ten     if(b!=0){ One          while(a%b!=0){ AC=b; -b=a%b; -A=C; the         } -     } -     returnb; - } + intGcd_2 (intAintb) {//the recursive method of dividing the Euclidean -     intC; +     if(b==0) c=A; A     Else atC=gcd_2 (b,a%b); -     returnC; - } - intMain () { -     intx,y,z,z2,*pa,*PB; -scanf"%d%d",&x,&y); inpa=&x,pb=&y;//if the *pa=x,*pb=y is changed here, then PA and PB are wild hands. - sort (PA,PB); toz=gcd_1 (x, y); +Z2=gcd_2 (x, y); -printf"%d\n%d\n", Z,Z2); the     return 0; *}

Seeking greatest common divisor by the method of dividing