Thursday, December 2, 2010

Bubble Sort

Bubble sort, also known as sinking sort, is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm gets its name from the way smaller elements "bubble" to the top of the list. Because it only uses comparisons to operate on elements, it is a comparison sort. The equally simple insertion sort has better performance than bubble sort, so some have suggested no longer teaching the bubble sort.

public IList BubbleSort(IList arrayToSort)
    int n = arrayToSort.Count - 1;
    for (int i = 0; i < n; i++)

        for (int j = n; j > i; j--)
            if (((IComparable)arrayToSort[j - 1]).CompareTo(arrayToSort[j]) > 0)
                object temp = arrayToSort[j - 1];
                arrayToSort[j - 1] = arrayToSort[j];
                arrayToSort[j] = temp;
                RedrawItem(j - 1);
                if (chkCreateAnimation.Checked)
    return arrayToSort;

No comments:

Post a Comment