以下程序的输出结果是（）。#icludestdio.hitf(itx){ity;if(x==0||x==1)retur(3);y=x*x-f(x-2);retur}itmai(){itz;z=f(3);pritf(%d,z);retur0;}
以下程序的输出结果是（）。#icludestdio.hitf(itx){ity;if(x==0||x==1)retur(3);y=x*x-f(x-2);retur}itmai(){itz;z=f(3);pritf(%d,z);retur0;}
4.试将折半查找的算法改写成递归算法。Itbisearch(sqlistL,itlow,ithigh,elemtypex){If(lowhigh)retur(0else{if(L.data[mid]==x)retur(mid);elseif(L.data[mid]x)bisearch(L,low,mid-1,x);elsebisearch(L,mid+1,high,x);}}//bisearch
4.试将折半查找的算法改写成递归算法。Itbisearch(sqlistL,itlow,ithigh,elemtypex){If(lowhigh)retur(0else{if(L.data[mid]==x)retur(mid);elseif(L.data[mid]x)bisearch(L,low,mid-1,x);elsebisearch(L,mid+1,high,x);}}//bisearch
1