Recursion Programs Solutions APC 1. int count(int n) { if(n==0) return 1; return 1+count(n/10); } 2. void dectobin(int n,int r){ if(n==0) { System.out.println("Binary is:"+r); } int d=n%2; r=r*10+d; dectobin(n/2,r); } 3. int count(int n){ if(n==0) return 0; int d=n%2; return ((d==1)?1:0)+count(n/2); } void check(int n){ if(count(n)==2) System.out.println("Prime number"); else System.out.println("Non-Prime number"); } 4. int fmin(int arr[],int n ) { if(n==0) return 999999; return Math.min(arr[n-1],fmin(arr,n-1)); } 5. int fsum(int arr[],int n ) { if(n==0) ...
To draw a square ------------------- import turtle t=turtle.Turtle() for i in range(4): t.forward(200) t.right(90) To draw a circle ---------------- import turtle t=turtle.Turtle() for i in range(360): t.forward(1) t.right(1) To draw a rectangle -------------------- import turtle t=turtle.Turtle() for i in range(3): t.forward(200) t.right(90) t.forward(80) t.right(90)