What's the most elegant way to bubble-sort in C#?

Question

Can this be cleaned up?

using System;  
class AscendingBubbleSort 
{     
    public static void Main()
    {
        int i = 0,j = 0,t = 0;
        int []c=         


        

Answer 1

• I would use a swap methed to swap the two array items. (details of how to write swap method left as homework!)

• You should think about the case when the items are already in order

• You should read up on Insertion sort for more marks :-)

• Rather then reading the test data from the keyboard, see if you can learn how to use nUnit