submitting milestone 17(a)

Milestone-17(a)/problem-01-17(a)- recursion -w3resource.cpp

@@ -0,0 +1,17 @@
+#include<iostream>
+using namespace std;
+void print(int n)
+{
+	if(n==1)
+	{
+		cout<<n<<" ";
+		return;
+	}
+	print(n-1);
+	cout<<n<<" ";
+}
+int main()
+{
+	int n=50;
+	print(n);
+}

Milestone-17(a)/problem-02-17(a).cpp

@@ -0,0 +1,21 @@
+#include<iostream>
+using namespace std;
+int add(int n)
+{
+	int sum=0;
+	if(n==1 || n==0)
+	{
+		return n;
+	}
+//	add(n-1);
+	sum=n+add(n-1);
+	return sum;
+}
+int main()
+{
+	int n;
+	cout<<"enter n-"<<endl;
+	cin>>n;
+	int x=add(n);
+	cout<<"addition- "<<x;
+}

Milestone-17(a)/problem-03-17(a).cpp

@@ -0,0 +1,17 @@
+#include<iostream>
+using namespace std;
+void print(int arr[],int index,int size)
+{
+	if(index>=size)
+	{
+	    return ;
+	}
+	cout<<arr[index]<<" ";
+	print(arr,index+1,size);
+
+}
+int main()
+{
+	int arr[]={1,2,3,4,5};
+	print(arr,0,5);
+}

Milestone-17(a)/problem-04-17(a).cpp

@@ -0,0 +1,17 @@
+#include<iostream>
+using namespace std;
+void print(int arr[],int index,int size)
+{
+	if(index>=size)
+	{
+	    return ;
+	}
+	cout<<arr[index]<<" ";
+	print(arr,index+1,size);
+
+}
+int main()
+{
+	int arr[]={1,2,3,4,5};
+	print(arr,0,5);
+}

Milestone-17(a)/problem-05-17(a).cpp

@@ -0,0 +1,21 @@
+#include<iostream>
+using namespace std;
+int counter=0;
+int count_digits(int n)
+{
+
+	if(n!=0)                    //    if(n<10)
+	{                           //    return 1;
+		counter++;              //    else
+		count_digits(n/10);     //    return 1+count_digits(n/10);
+	}
+	return counter;
+}
+int main()
+{
+	int n;
+	cout<<"enter n - "<<endl;
+	cin>>n;
+	int x=count_digits(n);
+	cout<<"no of digits - "<<x;
+}

Milestone-17(a)/problem-06-17(a).cpp

@@ -0,0 +1,18 @@
+#include<iostream>
+using namespace std;
+int sum=0;
+int sum_of_digits(int n)
+{
+	if(n==0)
+	{
+		return 0;
+
+	}
+	return n%10+sum_of_digits(n/10);
+}
+int main()
+{
+	int n;
+	cin>>n;
+	cout<<"sum of digits- "<<sum_of_digits(n);
+}

Milestone-17(a)/problem-07-17(a).cpp

@@ -0,0 +1,38 @@
+#include <iostream>
+
+using namespace std;
+int gcd(int n1,int n2,int val)
+{
+    cout<<"d"<<endl;
+    if(val>1)
+    {
+        cout<<"s"<<endl;
+        if(n1%val==0 && n2%val==0)
+        {
+            return val;
+        }
+
+        return gcd(n1,n2,val-1);
+    }
+    return 0;
+}
+
+int main()
+{
+    int n1,n2;
+    cout<<"enter first number"<<endl;
+    cin>>n1;
+    cout<<"enter second number"<<endl;
+    cin>>n2;
+    int val;
+    if(n1>n2)
+    {
+        val=n1;
+    }
+    else{
+       val=n2;
+    }
+    int x=gcd(n1,n2,val);
+    cout<<"GCD of"<<n1<<"and"<<n2<<"is "<<x;
+}
+

Milestone-17(a)/problem-08-17(a).cpp

@@ -0,0 +1,18 @@
+#include<iostream>
+using namespace std;
+int func(int arr[],int index,int size,int &max)
+	{
+    if(index < size)
+    {
+         if(max<arr[index])
+           max=arr[index];
+
+      func(arr,index+1,size,max);//calling the function MaxElem itself to compare with further element
+    }
+    return max;
+}
+int main()
+{
+	int arr[]={1,2,5,3,4,10};
+	cout<<" max element - "<<func(arr,0,6,arr[0]);
+}

Milestone-17(a)/problem-09-17(a).cpp

@@ -0,0 +1,20 @@
+#include<iostream>
+#include<string.h>
+using namespace std;
+void print(string s,int index)
+{
+	if(index>s.size())
+	{
+		return;
+	}
+	print(s,index+1);
+	cout<<s[index];
+}
+int main()
+{
+	string s;
+	cout<<"enter string"<<endl;
+	cin>>s;
+	print(s,0);
+
+}

Milestone-17(a)/problem-10-17(a).cpp

@@ -0,0 +1,20 @@
+#include<iostream>
+using namespace std;
+int fact(int n)
+{
+	if(n==0 ||n==1)
+	{
+		return n;
+	}
+	else
+	{
+		return n*fact(n-1);
+	}
+}
+int main()
+{
+	int n;
+	cout<<"enter number - "<<endl;
+	cin>>n;
+	cout<<"factorial of "<<n<<" is "<<fact(n);
+}

Milestone-17(a)/problem-11-17(a).cpp

@@ -0,0 +1,27 @@
+#include<iostream>
+using namespace std;
+
+long convert_binary(int n)
+{
+//	static long bin,rem,fact=1;
+	static long bin,rem,fact=1;
+cout<<"statcic bin -"<<bin<<endl;
+	if(n!=0)
+	{
+		rem=n%2;
+		bin=bin+rem*fact;
+		fact=fact*10;
+		convert_binary(n/2);
+	}
+	return bin;
+
+}
+int main()
+{
+
+	int n;
+	cout<<"enter decimal number"<<endl;
+	cin>>n;
+	cout<<"binary number - "<<convert_binary(n);
+
+}

Milestone-17(a)/problem-12-17(a).cpp

@@ -0,0 +1,31 @@
+#include<iostream>
+using namespace std;
+int count=0;
+bool prime(int ind,int n)
+{
+	if(ind<n)
+	{
+		if(n%ind==0)
+		{
+			count=1;
+			return false;
+		}
+		prime(ind+1,n);
+	}
+	return true;
+}
+int main()
+{
+	int n;
+	cout<<"enter number - ";
+	cin>>n;
+	prime(2,n);
+	if (count==0)
+	{
+		cout<<"prime number"<<endl;
+	}
+	else
+	{
+		cout<<"not a prime number "<<endl;
+	}
+}

Milestone-17(a)/problem-13-17(a).cpp

@@ -0,0 +1,22 @@
+#include<iostream>
+using namespace std;
+void print(int val,int n)
+{
+if(val>n)
+{
+	return;
+}
+cout<<val<<" ";
+print(val+2,n);	
+}
+int main()
+{
+	int n;
+	cout<<"enter n -"<<endl;
+	cin>>n;
+	cout<<"printing even numbers- ";
+	print(2,n);
+	cout<<endl;
+	cout<<"printing odd numbers - ";
+	print(1,n);
+}

Milestone-17(a)/problem-16-17(a).cpp

@@ -0,0 +1,29 @@
+#include<iostream>
+#include<string.h>
+using namespace std;
+string palindrome(char s1[],int size,int index)
+{
+	static string s2;
+	if(index>=size)
+	{
+		return s2;
+	}
+
+	palindrome(s1,size,index+1);
+	s2+=s1[index];
+	return s2;
+
+}
+int main()
+{
+	char s1[20];
+	string s;
+	cout<<"enter any string "<<endl;
+	cin>>s1;
+	int size=strlen(s1);
+	s=palindrome(s1,size,0);
+	if(s1==s)
+	cout<<"yes";
+	else
+	cout<<"no";
+}

Milestone-17(a)/problem-17-17(a).cpp

@@ -0,0 +1,32 @@
+#include<iostream>
+using namespace std;
+int pow(int x,int p)
+{
+	if(p==0)
+	{
+		return 0;
+	}
+	else if(p==1)
+	{
+		return x;
+	}
+	else
+	{
+		if(p%2==0)
+		{
+			int y=pow(x,p/2);
+			return y*y;
+		}
+		else
+		return pow(x,p-1);
+	}
+}
+int main()
+{
+	int x,p;
+	cout<<"enter number whose power needs to be calculated"<<endl;
+	cin>>x;
+	cout<<"enter power - ";
+	cin>>p;
+	cout<<"ans- "<<pow(x,p);
+}

Milestone-17(a)/problem-19-17(a).cpp

@@ -0,0 +1,24 @@
+#include<iostream>
+using namespace std;
+string copystring(string s1,int index,int size)
+{
+	static string s2="";
+	if(index>=size)
+	{
+		return s2;
+	}
+	else
+	{
+		s2=s2+s1[index];
+		copystring(s1,index+1,size);
+	}
+	return s2;
+}
+int main()
+{
+	string s1;
+	cout<<"enter string"<<endl;
+	cin>>s1;
+	string s=copystring(s1,0,s1.size());
+	cout<<"copied string - "<<s;
+}