Methods to exchange two variables
Exchange two numbers using the third variable in C#
int number1=10,number2=20,temp=0; temp=number1; number1=number2; number2=temp;
Methods to exchange numbers without using a third variable
-
By * and/
int number1=10,number2=20; number1=number1*number2; //200 number2=number1/number2; //10 number1= number1/number2; //20
-
By + and -
int number1=10,number=20; number1=number1+number2; //30 number2=number1-number2; //10 number1=number1-number2; //20
Methods to exchange strings without using a third variable
string name1="Dotnet", name2="C#"; name1=name1+name2; //DotnetC# name2=(0,); //Dotnet name1=(); //C#
Fibonacci series
The Fibonacci sequence is a sequence of numbers arranged in the following order:
Methods to implement Fibonacci sequences in C#
- Iteration
- recursion
Methods to iteratively print Fibonacci sequences:
int firstNumber=0;SecondNumber=1;nextNumber;
("Enter the number of elements printed:");
int numberOfElement=(());
if(numberOfElements>2)
{
($"{firstNumber} {SecondNumber}");
for(int i=2;i<numberOfElements;i++)
{
nextNumber=firstNumber+SecondNumber;
($"{nextNumber} ");
firstNumber=SecondNumber;
SecondNumber=nextNumber;
}
}Methods to recursively print Fibonacci sequences:
("Enter the number of elements printed:");
int numberOfElement=(());
FibonacciSeries(0,1,1,numberOfElement);
//Recursive printing methodFibonacciSeries(int firstNumber,int secondNumber,int Counter,int number)
{
($"{firstNumber} ");
if(counter<number)
FibonacciSeries(secondNumber,firstNumber+secondNumber,counter+1,number);
}How to find the Nth Fibonacci sequence number from the Fibonacci sequence?
static void Main(string[] args)
{
("Please enter the number of the Fibonacci value you need to obtain: ");
int number = (());
//Because the sequence starts from 0, we need -1 when calculating a certain bit; number = number - 1;
(NthFibonacciNumber(number));
();
}
private static int NthFibonacciNumber(int number)
{
int firstNumber = 0, secondNumber = 1, nextNumber = 0;
//If you enter 0, return 0 if (number == 0)
return firstNumber;
for (int i = 2; i <= number; i++)
{
nextNumber = firstNumber + secondNumber;
firstNumber = secondNumber;
secondNumber = nextNumber;
}
return secondNumber;
}Prime number
Prime numbers are also called prime numbers. A natural number greater than 1. A number that cannot be divided by other natural numbers except 1 and itself is called prime numbers. ,For example: 2, 3, 5, 7, 11, 13, 17, 19, 23... is a prime number.
("Input number: ");
int number = (());
bool IsPrime = true;
for (int i = 2; i < number / 2; i++)
{
if (number % i == 0)
{
IsPrime = false;
break;
}
}
if (IsPrime)
($"{number}It's a prime number");
else
($"{number}不It's a prime number");
();How to print all prime numbers between two numbers?
("Enter the start number: ");
int startNumber = (());
("Input end number: ");
int endNumber = Convert.ToInt32(());
for (int i = startNumber; i <= endNumber; i++)
{
int counter = 0;
for (int j = 2; j <= i / 2; j++)
{
if (i % j == 0)
{
counter++;
break;
}
}
if (counter == 0 && i != 1)
{
("{0} ", i);
}
}
();
}Pastoral (number and string)
-
Number of palindromes
is a set of numbers, which are the same as before after inversion. For example: 121, 343, 7887, etc.
-
Pastoral string
A set of text, after returning the text, the same as the original one. For example: ABA, I love me, etc.
How to check whether a number belongs to a palindrome number?
static void Main(string[] args)
{
("Please enter the number to be checked: ");
int number = (());
int remineder, sum = 0;
int temp = number;
while (number > 0)
{
//Get the remainder remineder = number % 10;
//Sum *10, then add to the remainder sum = (sum * 10) + remineder;
//Divide by 10 to get the quotient number = number / 10;
}
if (temp == sum)
($"{temp}It's a reply");
else
($"{temp}不It's a reply");
();
}How to check if a string belongs to a palindrome?
- Method 1
static void Main(string[] args)
{
("Enter the palindrome to check: ");
string name = ();
string reverse = ;
for (int i = - 1; i >= 0; i--)
reverse += name[i];
if (name == reverse)
($"{name}It's a reply");
else
($"{name}不It's a reply");
();
}- Method 2
static void Main()
{
("Enter the palindrome to check: ");
string name = ();
string reverse = ;
foreach (char c in name)
reverse = c + reverse;
if ((reverse, ))
($"{name}It's a reply");
else
($"{name}不It's a reply");
();
}- Method 3
static void Main()
{
("Enter the palindrome to check: ");
string name = ();
char[] nameArray = ();
(nameArray);
string reverse = new string(nameArray);
if ((reverse, ))
($"{name}It's a reply");
else
($"{name}不It's a reply");
();
}The above is all the content of this article. I hope it will be helpful to everyone's study and I hope everyone will support me more.