public class BubbleSort
{
public BubbleSort()
{
}
public static void main ( String args[] )
{
int data[] = { 63, 56, 98, 12, 24 };
int n = data.length;
// bubblesort(data, n);//冒泡排序
//selectionSort(data, n);//選擇排序
insertionSort(data,n);//插入排序
for (int i = 0; i < n; i++)
{
System.out.println(data[i]);
}
}
public static void swap ( int data[] , int i , int j )
{
int temp;
temp = data[i];
data[i] = data[j];
data[j] = temp;
}
/*
*/
public static void bubblesort ( int data[] , int n )
{
int numsorted = 0;
int index;
while (numsorted < n)
{
for (index = 1; index < n – numsorted; index++)
{
if (data[index – 1] > data[index])
swap(data, index – 1, index);
}
numsorted++;
}
}
/*
*/
public static void selectionSort ( int data[] , int n )
{
int numUnsorted = n;
int index;
int max;
while (numUnsorted > 0)
{
max = 0;
for (index = 1; index < numUnsorted; index++)
{
if (data[max] < data[index])
max = index;
}
swap(data, max, numUnsorted – 1);
numUnsorted — ;
}
}
/*
*/
public static void insertionSort ( int data[] , int n )
{
int numSorted = 1;
int index;
while (numSorted < n)
{
int temp = data[numSorted];
for (index = numSorted; index > 0; index — )
{
if (temp < data[index – 1])
{
data[index] = data[index – 1];
} else
{
break;
}
}
data[index] = temp;
numSorted++;
}
}
}