(9). 6.2 Function Challenges. - anishsingh90/Data_Structure_And_Algorithm_In_Cpp_github.io GitHub Wiki

//Print all prime numbers between 2 given numbers. #include #include <math.h> using namespace std;

bool isPrime(int num){ for(int i=2;i<=sqrt(num);i++){ if(num%i==0){ return false; } } return true; }

int main(){ int a,b; cout << "Enter the number a: "; cin >> a;

cout << "Enter the number b: ";
cin >> b;

for(int i=a;i<=b;i++){
	if(isPrime(i)){
		cout << i << endl;
	}
}
return 0;

}

/* OUTPUT: Enter the number a: 2 Enter the number b: 10 2 3 5 7 */

//Fibonacci Sequence #include using namespace std;

void fib(int n){ int t1=0; int t2=1; int nextTerm;

for(int i=1;i<=n;i++){
	cout << t1 << endl;
	nextTerm=t1 + t2;
	t1=t2;
	t2=nextTerm;
}
return;

}

int main(){ int n; cout << "Enter the number: "; cin >> n;

fib(n);
return 0;

}

/* OUTPUT: Enter the number: 5 0 1 1 2 3 */

//Factorial of a number n. #include using namespace std;

int fact(int n){ int factorial = 1; for(int i=2;i<=n;i++){ factorial = factorial *= i; } return factorial; }

int main(){ int n; cout << "Enter the number: "; cin >> n;

int ans= fact(n);
cout << ans << endl;

return 0;

}

/* OUTPUT: Enter the number: 4 24 */

//Calculate nCr #include using namespace std;

int fact(int n){ int factorial=1; for(int i=2;i<=n;i++){ factorial *= i; } return factorial; }

int main(){ int n,r; cout <<"Enter the n: "; cin >> n;

cout << "Enter the r: ";
cin >> r;

int ans = fact(n)/(fact(r)*fact(n-r));
cout << ans << endl;

return 0;

}

/* OUTPUT: Enter the n: 5 Enter the r: 2 10 */

//Pascal Triangle #include using namespace std;

int fact(int n){ int factorial=1; for(int i=2;i<=n;i++){ factorial *= i; } return factorial; }

int main(){ int n; cout << "Enter the number: "; cin >> n;

for(int i=0;i<n;i++){
	for(int j=0;j<=i;j++){
		cout << fact(i)/(fact(j)*fact(i-j))<<" ";
	}
	cout << endl;
}

return 0;

}

/* OUTPUT: Enter the number: 5 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 */