using System;

using [Link];
using [Link];
using [Link];
using [Link];

namespace CsharpPractice1
{
public class PracticeLevel1
{
public static void TestFib()
{
int a, b, c, n;
[Link]("Enter the number of terms:");
n = [Link]([Link]());
a = 0;
b = 1;
[Link]($"{a} ");
[Link]($"{b} ");
for (int i = 1; i <= n; i++)
{
c = a + b;
a = b;
b = c;
[Link]($"{c} ");
}
}

public static int DigitReverse()

{
string result = "";
[Link]("Enter a 4-digit number: ");
int num = Convert.ToInt32([Link]());
if (num <= 0)
{
return -1;
}
int x = num;
for (int i = 1; i <= 4; i++)
{
int digit = num % 10;
num = num / 10;
result += [Link]();
}
[Link]($"Reverse of {x} is : {result}");
[Link]("Enter a number to multiply with reverse number:");
int num1 = Convert.ToInt32([Link]());
num = [Link](result) * num1;
[Link]($"Multiplying {result} with {num1}: {num}");
return 1;
}

public static void CalculateAreaOfShape()

{
go:
[Link]("Choose a shape below to caluate its area: ");
[Link]("===========================================");
[Link]("Circle");
[Link]("Cylinder");
 string shapeName = [Link]();
switch ([Link]())
{
case "circle":
[Link]("Enter radius of a Circle:");
float radiusOfCircle = [Link]([Link]());

[Link]("What do you want to calculate: ");

[Link]("===========================================");
[Link]("Area");
[Link]("Diameter");

string calculationType = [Link]();

if (calculationType == "area")
{
double areaOfCircle = 3.14 * radiusOfCircle *
radiusOfCircle;
[Link]($"Area of circle with radius
{radiusOfCircle} is {areaOfCircle}");
}
else if (calculationType == "diameter")
{
double diameterOfCircle = 2 * radiusOfCircle;
[Link]($"Diameter of circle with radius
{radiusOfCircle} is {diameterOfCircle}");
}
else
{
[Link]("Input must be Area or Diameter");
}
break;
case "cylinder":
[Link]("What do you want to calculate: ");

[Link]("===========================================");
[Link]("BaseArea");
[Link]("Volume");
string calculationType1 = "";
calculationType1 = [Link]();
if (calculationType1 == "basearea")
{
[Link]("Enter radius of a Cylinder:");
float radiusOfCylinder =
[Link]([Link]());

double areaOfCylinder = 3.14 * radiusOfCylinder *

radiusOfCylinder;
[Link]($"Base Area of Cylinder with radius
{radiusOfCylinder} is {areaOfCylinder}");
}
else if (calculationType1 == "volume")
{
[Link]("Enter radius of a Cylinder:");
float radiusOfCylinder =
[Link]([Link]());
[Link]("Enter height of a Cylinder:");
float heightOfCylinder =
[Link]([Link]());

double areaOfCylinder = 2 * 3.14 * radiusOfCylinder *

radiusOfCylinder + 2 * 3.14 * radiusOfCylinder * heightOfCylinder;
[Link]($"Volume of Cylinder with radius
{radiusOfCylinder} and height {heightOfCylinder} is {areaOfCylinder}");
}
else
{
[Link]("Input must be BaseArea or Volume");
}
break;
}
[Link]("Do you want to check any more SHAPE enter yes . ");
if ([Link]() != "yes")
{
[Link]("Thank you");
[Link]();
}
else
{
goto go;
}
}

public static void ArmstrongNumberTest()

{
int n, r, sum = 0, temp;
n = Convert.ToInt32([Link]());
temp = n;
while (n > 0)
{
r = n % 10;
sum = sum + r * r * r;
n = n / 10;
}
if (temp == sum)
{
[Link]($"{temp} is an ArmStrong number");
}
else
{
[Link]($"{temp} is not an ArmStrong number");
}
}

public static void Array_Number_Position()

{
int[] arr = new int[6] { 45, 2, 65, 87, 24, 65 };
[Link]("enter a number: ");
int n = Convert.ToInt32([Link]());
int flag = 0; int k = 0;

foreach (int num in arr)

{
if (num == n)
{
flag++;
if (flag == 1)
 [Link]($"Number {n} is in the position");
[Link](k);
}
k++;
}
if (flag == 0)
{
[Link]("Number not found");
}
}

public static void PrimeNumberTest()

{
int i; int number;

[Link]("Enter number:");
number = Convert.ToInt32([Link]());
int flag = 0;
for (i = 1; i <= number; i++)
{
if (number % i == 0)
{
flag++;
}
}
if (flag == 2)
{
[Link]($"{number} is prime");
}
else
{
[Link]($"{number} is not prime");
}

public static void Array_Max_1()

{
int[] arr = new int[6] { 45, 2, 65, 87, 24, 65 };
int n = 0;
foreach (int num in arr)
{
if (num > n)
{
n = num;
}
}
[Link]($"Max num in the array is: {n}");
}

public static void Array_Max_2()

{
int[] arr = new int[6] { 45, 2, 65, 87, 24, 65 };
int temp = 0; int i;
for (i = 0; i < 5; i++)
{
if (arr[i] > arr[i + 1])
{
temp = arr[i];
 arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
[Link]($"Max number in the array : {arr[i]} ");
}

public static void Array_Ascending()

{
int[] arr = new int[6] { 145, 2, 265, 87, 24, 15 };
int temp = 0; int i;

for (int j = 5; j >= 1; j--)

{
for (i = 0; i < 5; i++)
{
if (arr[i] > arr[i + 1])
{
temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
}
[Link]($"Array in Ascending order:");
foreach (int k in arr)
{
[Link]($"{k} ");
}
}

public static void Array_Descending()

{
int[] arr = new int[6] { 145, 2, 265, 87, 24, 15 };
int temp = 0; int i;

for (int j = 5; j >= 1; j--)

{
for (i = 0; i < 5; i++)
{
if (arr[i] < arr[i + 1])
{
temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
}
[Link]($"Array in Descending order:");
foreach (int k in arr)
{
[Link]($"{k} ");
}
}

public static void Array_3()

{
[Link] myStopWatch = new
[Link]();
 [Link]();
int[] arr = new int[200];
int i;
for (i = 0; i <= 199; i++)
{
arr[i] = i;
}

[Link]();
[Link]($"Time taken :
{[Link]()}");
}

public static void Array_FindPrime_In_Array_Final()

{
[Link] myStopWatch = new
[Link]();
[Link]();
int[] arr = new int[1000];
int i; int flag = 0;
for (i = 0; i <= 999; i++)
{
arr[i] = i + 1;
}
for (i = 0; i <= 999; i++)
{
flag = 0;
for (int j = 1; j <= arr[i]; j++)
{
if (arr[i] % j == 0)
{
if (arr[i] == 1)
{
[Link]($"{arr[i]} is neutral");
break;
}
if (flag >= 3 && j == arr[i])
{
[Link]($"{arr[i]} is not a prime");
}

flag++;
if (flag == 2 && j == arr[i])
[Link]($"{arr[i]} is prime");
}
}
}
[Link]();
[Link]($"Time taken :
{[Link]()}");
}

public static void Array_FindPrime_In_Array_1()

{
[Link] myStopWatch = new
[Link]();
[Link]();
int[] arr = new int[10] { 251, 1, 241, 90, 277, 1, 132, 38, 199, 37 };
int flag = 0; int i;
 for (i = 0; i <= 9; i++)
{
flag = 0;
int n = arr[i];
for (int j = 1; j <= n / 2; j++)
{
if (n % j == 0)
{
if (n == 1)
{
[Link]($"{n}\t is neutral");
break;
}
if (flag >= 3 && j == n)
{
[Link]($"{n}\t is not a prime");
}
flag++;
if (flag == 2 && j == n)
[Link]($"{n}\t is prime");
}
}
}
[Link]();
[Link]($"Time taken :
{[Link]()}");
}

private static bool CheckPrime(int num)

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

public static void FindPrimeNumbersInArray()

{
[Link] myStopWatch = new
[Link]();
[Link]();

bool isPrime = false;

int[] arr = new int[10] { 251, 1, 241, 90, 277, 1, 132, 38, 199, 37 };
//int[] arr = new int[1000];
//int j;

//for (j = 0; j <= 999; j++)

//{
// arr[j] = j + 1;
//}
 for (int i = 0; i <= 9; i++)
{
if (arr[i] == 1)
{
[Link]($"{arr[i]} is neutral");
}
else
{
isPrime = CheckPrime(arr[i]);
if (isPrime)
{
[Link]($"{arr[i]}\t is not a prime");
}
else
{
[Link]($"{arr[i]}\t is a prime");
}
}
}
[Link]();
[Link]($"Time taken :
{[Link]()}");
}

public static void CalculatePowerOfANumber_Recursive()

{
int num, power, result;
[Link]("Enter number =");
num = Convert.ToInt32([Link]());
[Link]("Enter exponent of number=");
power = Convert.ToInt32([Link]());
result = CalculatePower_Recursive(num, power);
[Link]($"Recursive {num} to the power of {power} :
{result}");
}

private static int CalculatePower_Recursive(int number, int exponent)

{
if (exponent == 0)
return 1;
else
return number * CalculatePower_Recursive(number, exponent - 1);
}

public static void CalculatePowerOfANumber()

{
int num, power; long result = 1, i;
[Link]("Enter number =");
num = Convert.ToInt32([Link]());
[Link]("Enter exponent of number=");
power = Convert.ToInt32([Link]());
for (i = 0; i < power; i++)
{
result = result * num;
}
[Link]($" {num} to the power of {power} : {result}");
}

public static void CountDigitsInANUmber()

{
int n, i = 0, temp = 0;

[Link]("Enter number =");

n = Convert.ToInt32([Link]());
temp = n;
if (n == 0)
{
[Link]("There is only 1 digit in your number.");
}
else
{
while (n != 0)
{
n = n / 10;
i++;
}
[Link]($"There are {i} digits in number {temp}");
}
}

public static void SumOfNaturalNumber()

{
int n, i, sum = 0;
[Link]("Enter of number");
n = Convert.ToInt32([Link]());

for (i = 1; i <= n; i++)

{
sum += i;
}
[Link]($"Sume of {n} natural numbers is : {sum}");
}

public static void Array_Max_MIn()

{
int[] arr = new int[6] { 45, 2, 65, 87, 24, 65 };
int max = arr[0], i, min = arr[0]; ;
for (i = 0; i < [Link]; i++)
{
if (arr[i] > max)
max = arr[i];
}
for (i = 0; i < [Link]; i++)
{
if (arr[i] < min)
min = arr[i];
}

[Link]($"Max num and Min num in the array is: {max},{min}");

}

public static void Array_Third_Max()

{
int[] arr = new int[6] { 45, 2, 65, 87, 24, 65 };
int max1 = 0, max2 = 0, max3 = 0; int i; int n = 0;
for (i = 0; i < [Link]; i++)
{
if (arr[i] > max1)
 {
max3 = max2;
max2 = max1;
max1 = arr[i];
}
else if (arr[i] > max1)
{
max3 = max2;
max2 = arr[i];
}
else if (arr[i] > max1)

{
max3 = arr[i];
}
}
[Link]($"Third Max,Second Max,Max num : {max3},{max2},
{max1}");
}

public static void Median_Array()

{
int i, j, n = 0; float median = 0;
int[] arr = new int[6] { 45, 2, 65, 87, 24, 65 };

n = [Link];

[Link]($"Array in ascending order: ");

int temp = 0;

for (j = 5; j >= 1; j--)

{
for (i = 0; i < 5; i++)
{
if (arr[i] < arr[i + 1])
{
temp = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = temp;
}
}
}
foreach (var item in arr)
{
[Link]($"{item} \n");
}

if (n % 2 == 0)
{
median = (arr[n / 2] + arr[n / 2 + 1]) / 2.0f;
[Link]($"The median is: {median} ");
}
else
{
median = arr[n / 2 + 1];
[Link]($"Array in ascending order: {median} ");
}
 }

}
}