三元表達式及經典冒泡排序算法

1.三元表達式;排序

 Console.WriteLine("請輸入第一個數字");            it

int numberOne = Convert.ToInt32(Console.ReadLine());數字

Console.WriteLine("請輸入第二個數字");            

int numberTwo = Convert.ToInt32(Console.ReadLine());

           

Console.WriteLine("請輸入第三個數字");            

int numberThree = Convert.ToInt32(Console.ReadLine());            

if (numberOne > numberTwo)            

{                

Console.WriteLine("這兩個數字中比較大的是{0}", numberOne);            

}            

else            

{                

Console.WriteLine("這兩個數字中比較大的是{0}", numberTwo);            

}

 int max = (numberOne > numberTwo ? numberOne : numberTwo) > numberThree ? (numberOne > numberTwo ? numberOne : numberTwo) : numberThree;            

Console.WriteLine("這兩個數字中比較大的是{0}", max);            

Console.ReadKey();

 

2.冒泡排序;

int[] numbers = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };            

for (int i = 0; i < numbers.Length - 1; i++)            

{                              

for (int j = 0; j < numbers.Length - 1 - i; j++)                

{                    

if (numbers[j] > numbers[j + 1])                    

{                        

int temp = numbers[j];                        

numbers[j] = numbers[j + 1];                        

numbers[j + 1] = temp;                   

  }               

  }            

}

 for (int i = 0; i < numbers.Length; i++)            

{                

Console.WriteLine(numbers[i]);            

}            

Console.ReadKey();

相關文章
相關標籤/搜索