Functions

Author: Derrick1908

Basic_Functions.cpp

@@ -0,0 +1,50 @@
+#include <stdio.h> 
+#include<conio.h>
+
+int maximum(int, int); /*Function Declaration*/
+void multiply(int f, int g);/*Function Declaration, Here f and g are optional */
+void introduction();
+int addition(int, int);
+
+int main()
+{
+	int a, b, c, max;
+	printf("\nEnter the Values of a and b :: ");
+	scanf_s("%d %d", &a, &b);          
+	
+	introduction();  /*Function Call*/
+	c = addition(a, b);
+	printf("\nThe Addition of a and b is :: %d", c);
+	max = maximum(a, b); /* Calling above function (Function Call) to find max of 'a' and 'b' */
+
+	printf("\nThe Maximum among the Two Numbers is %d", max);
+	multiply(a,b);
+	_getch();
+	return 0;
+}
+
+/* An example function that takes two parameters 'x' and 'y' as input and returns max of two input numbers  */
+int maximum(int x, int y)       /*Function Definition*/
+{
+	if (x > y)					/* Here x and y are called formal parameters */
+		return x;              /*Whereas a and b are called actual parameters */
+	else
+		return y;
+}
+
+void multiply(int p, int q)    /*Function Defintion, this can be done in one line. This Function does not return anything */
+{
+	printf("\nThe Product of a and b is :: %d", p*q);       
+}
+
+inline int addition(int r, int s)
+{
+	return(r + s);
+}
+
+void introduction() /*This Fucntion does not receive any parameters/arguments */
+{
+	printf("Hi\n");
+	printf("How have you'll been during this Lockdown");
+	/* There is no return statement inside this function, since its return type is void */
+}

Call_Value_Reference.cpp

@@ -0,0 +1,44 @@
+#include<stdio.h>
+#include<conio.h>
+
+void swap_value(int, int);
+void swap_reference(int *, int *);
+
+void main()
+{
+	int a, b;   /*a is name for a memory location*/
+	printf("\nEnter the Values of a and b :: ");
+	scanf_s("%d %d", &a, &b);
+
+	printf("\n********IN MAIN *************");
+	printf("\nThe Values of a and b before Swapping are :: a = %d  b = %d", a, b);
+	//swap_value(a,b);           /*Here the values of a and b are sent to the Swap Function */
+	swap_reference(&a, &b);     /*Here the address of a and b are sent and not their values*/
+	printf("\n********BACK IN MAIN *************");
+	printf("\nThe Values of a and b after Swapping are :: a = %d  b = %d", a, b);
+	_getch();
+}
+
+void swap_value(int x, int y)
+{
+	int temp;
+	printf("\n********IN SWAP Function*************");
+	printf("\nThe Values of x and y before Swapping are :: x = %d  y = %d", x, y);
+	temp = x;
+	x = y;
+	y = temp;
+	printf("\nThe Values of x and y after Swapping are :: x = %d  y = %d", x, y);
+
+}
+
+void swap_reference(int *x, int *y)
+{
+	int temp;
+	printf("\n********IN SWAP Function*************");
+	printf("\nThe Values of x and y before Swapping are :: x = %d  y = %d", *x, *y);
+	temp = *x;     /* '*' has to be read as value at */
+	*x = *y;
+	*y = temp;
+	printf("\nThe Values of x and y after Swapping are :: x = %d  y = %d", *x, *y);
+
+}

Iteration_Recursion.cpp

@@ -0,0 +1,35 @@
+#include<stdio.h>
+#include<conio.h>
+
+int factorial(int ); /*Recursive Function*/
+int factorial_iter(int );
+
+void main()
+{
+	int num;
+	printf("\nEnter the Number :: ");
+	scanf_s("%d", &num);
+
+	printf("\nThe Factorial of %d through Recursion is :: %d", num, factorial(num));
+	printf("\nThe Factorial of %d through Iteration is :: %d", num, factorial_iter(num));
+
+	_getch();
+}
+
+int factorial(int n)           /*Note that a Recursive function has to have an if statement in order to end */
+{                              /* otherwise it would go into an infinite loop. No Loop is permitted in a recursive function*/
+	if (n == 0)
+		return 1;
+	else
+		return n*factorial(n - 1);
+}
+
+int factorial_iter(int n)
+{
+	int i, fact = 1;
+
+	for (i = n; i >= 1; i--)
+		fact = fact * i;
+	
+	return fact;
+}