60 lines
1.4 KiB
C#
60 lines
1.4 KiB
C#
/*
|
|
* Copyright (C) 2017 Kevin Cotugno
|
|
* All rights reserved
|
|
*
|
|
* Distributed under the terms of the MIT software license. See the
|
|
* accompanying LICENSE file or http://www.opensource.org/licenses/MIT.
|
|
*/
|
|
|
|
using System;
|
|
|
|
class Ratio
|
|
{
|
|
public static void Main(string[] args)
|
|
{
|
|
int num;
|
|
int[] elements;
|
|
|
|
Console.Write("How many elements? ");
|
|
|
|
try {
|
|
num = int.Parse(Console.ReadLine());
|
|
|
|
elements = new int[num];
|
|
for (int i = 0; i < num; i++)
|
|
{
|
|
Console.Write("Enter element {0}: ", i + 1);
|
|
elements[i] = int.Parse(Console.ReadLine());
|
|
}
|
|
|
|
Console.WriteLine("Unsorted: [{0}]", string.Join(", ", elements));
|
|
Console.WriteLine("Sorted: [{0}]", string.Join(", ", BubbleSort(elements)));
|
|
}
|
|
catch {
|
|
Environment.Exit(1);
|
|
}
|
|
|
|
}
|
|
|
|
private static int[] BubbleSort(int[] unsorted)
|
|
{
|
|
var count = unsorted.Length;
|
|
int t;
|
|
|
|
for (int i = 0; i < count; i++)
|
|
{
|
|
for (int j = 0; j < (count - i - 1); j++)
|
|
{
|
|
if (unsorted[j] > unsorted[j + 1])
|
|
{
|
|
t = unsorted[j];
|
|
unsorted[j] = unsorted[j + 1];
|
|
unsorted[j + 1] = t;
|
|
}
|
|
}
|
|
}
|
|
|
|
return unsorted;
|
|
}
|
|
}
|