第三周作业——冒泡排序(BubbleSort)与归并排序(MergeSort)

package 算法作业;

public class BubbleSort{

public void bubble(int[] a)
{
for(int i=a.length-1;i>0;i--){
for(int j=0;j0){
swap(a,j,j+1);
}
}
}
}

public void swap(int[] a,int x,int y)
{
int temp;
temp=a[x];
a[x]=a[y];
a[y]=temp;
}

public static void main(String[] args){
int[] a = {3,5,9,4,7,8,6,1,2,10,0};
System.out.print("开始排序前的数列为：");
for(int num:a)
{
System.out.print(num + " ");
}
BubbleSort bubble = new BubbleSort();
bubble.bubble(a);
System.out.println();
System.out.print("冒泡排序后的数列为：");
for(int num:a)
{
System.out.print(num + " ");
}
}
}

package 算法作业;

public class MergeSort{

public void partition(Integer[] arr, int from, int end) {
if (from < end)
{
int mid = (from + end) / 2;
partition(arr, from, mid);
partition(arr, mid + 1, end);
merge(arr, from, end, mid);
}
}

public void merge(Integer[] arr, int from, int end, int mid) {
Integer[] tmpArr = new Integer[11];
int tmpArrIndex = 0;
int part1ArrIndex = from;
int part2ArrIndex = mid + 1;

while ((part1ArrIndex <= mid) && (part2ArrIndex <= end))
{
if (arr[part1ArrIndex] - arr[part2ArrIndex] < 0)
{
tmpArr[tmpArrIndex++] = arr[part1ArrIndex++];
} else
{
tmpArr[tmpArrIndex++] = arr[part2ArrIndex++];
}
}

while (part1ArrIndex <= mid)
{
tmpArr[tmpArrIndex++] = arr[part1ArrIndex++];
}

while (part2ArrIndex <= end)
{
tmpArr[tmpArrIndex++] = arr[part2ArrIndex++];
}

System.arraycopy(tmpArr, 0, arr, from, end - from + 1);
}

public static void main(String[] args) {
Integer[] intgArr = {5,9,1,4,2,6,3,8,0,7,10};
System.out.print("开始排序前的数列为：");
for(Integer a:intgArr)
{
System.out.print(a + " ");
}
MergeSort insertSort = new MergeSort();
insertSort.partition(intgArr,0,intgArr.length-1);
System.out.println();
System.out.print("归并排序后的数列为：");
for(Integer a:intgArr)
{
System.out.print(a + " ");
}
}
}