Practice Set Chapter07 Dhammal recursion

 package com.company;

public class CWH_35_PracticeSet07 {
static float fare(float c){
float f=0;
f=(c*9/5)+32;
return f;
}
static void pattern2_rec(int n){
if(n>0) {
// pattern2_rec(n+1);
for (int i = 0; i <= n - 1; i++) {
System.out.print("* ");
// pattern2_rec(n - 1);

}
System.out.println("");
pattern2_rec(n - 1);
// System.out.println("");
}
}
static void pattern_rec(int n){
if (n>0){
pattern_rec(n-1);
for(int i=0;i<n;i++){
System.out.print("*"+" ");
}
System.out.println("");
}
}
static float aver(float ... arr){
float average=0.0f;
float sum=0.0f;
for(float e:arr){
sum+=e;
}
return sum/arr.length;
}

static int fib(int n){
if (n==1){
return 0;
}
else if(n==2){
return 1;
}
else {
return fib(n-2)+fib(n-1);
}
}
static void pattern1(int n){
for(int i=n;i>=1;i--){
for(int j=1;j<=i;j++){
System.out.print("*"+ " ");
}
System.out.println("");
}
}
static int sum(int n){
if(n==0){
return 0;
}
// for(int i=1;i<=n;i++){
// sum1+=i;
else {
return n + sum(n - 1);
}
}
static void pattern(int n) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
System.out.print("*" + " ");
}
System.out.println("");
}
}

public static void main (String[]args){
// Fibonacci series m1
// int i = 0;
// int j = 1;
// int z;
// int a = 1;
// System.out.print(i + " ");
// System.out.print(j + " ");
// while (a < 10) {
// z = i + j;
// System.out.print(z + " ");
// i = j;
// j = z;
// a++;
//
//
// }
// Question 1
// sum(4);

// Question 2
// pattern(10);

// Question 3
// System.out.println("The sum is "+sum(10));


// Question 4
//pattern1(9);
// Question 5
// System.out.println(fib(3));

// Question 6
// System.out.println(aver(3.4f,4.44f,5,6,7,8));

// Question 8
// pattern_rec(4);

// Question 7
// pattern2_rec(4);

// Question 9
System.out.println( fare(8)); }
}




Comments