package com.sharpandroid.junitTest;
import java.util.Random;
import org.junit.Test;
/**
* 说明:该算法为插入排序算法,从第二个位置也就是索引为1的位置开始存储排序的数据(第1位置不用),大致
* 思路如下:
* 大的数据往下沉,小的往上浮。(这里采用前者)
* @author xuecheng
*
*/
public class Sort_bubbleSort {
private int [] arrayA = null;
private int length = 1000 + 1;//1000个数字,第一个位置不用
@Test
public void insertSort() {
//fail("Not yet implemented");
getData();
System.out.println("insert sort begin");
long now = System.nanoTime();
doSort(arrayA);
long last = System.nanoTime() - now;
System.out.println("insert sort end, duration = " + last);
printArray(arrayA);
}
private void getData() {
arrayA = new int[length];
Random random = new Random(System.currentTimeMillis());
for (int i = 0; i < length; i++) {
arrayA[i] = random.nextInt(1000) + 1;
}
}
private void doSort(int array[]) {
for (int i = array.length - 1; i >= 1; i--) {
int k = 1;
int j = k+1;
for (; j <= i; k++, j++) {
if (array[k] > array[j]) {
exchangeValue(array, k, j);
}
}
}
}
private void exchangeValue(int array[], int indexA, int indexB) {
int temp = array[indexB];
array[indexB] = array[indexA];
array[indexA] = temp;
}
private void printArray(int array[]) {
for (int i = 1; i < array.length; i++) {
System.out.print("i = " + i + ", value = " + array[i] + "\n");
}
}
}
import java.util.Random;
import org.junit.Test;
/**
* 说明:该算法为插入排序算法,从第二个位置也就是索引为1的位置开始存储排序的数据(第1位置不用),大致
* 思路如下:
* 大的数据往下沉,小的往上浮。(这里采用前者)
* @author xuecheng
*
*/
public class Sort_bubbleSort {
private int [] arrayA = null;
private int length = 1000 + 1;//1000个数字,第一个位置不用
@Test
public void insertSort() {
//fail("Not yet implemented");
getData();
System.out.println("insert sort begin");
long now = System.nanoTime();
doSort(arrayA);
long last = System.nanoTime() - now;
System.out.println("insert sort end, duration = " + last);
printArray(arrayA);
}
private void getData() {
arrayA = new int[length];
Random random = new Random(System.currentTimeMillis());
for (int i = 0; i < length; i++) {
arrayA[i] = random.nextInt(1000) + 1;
}
}
private void doSort(int array[]) {
for (int i = array.length - 1; i >= 1; i--) {
int k = 1;
int j = k+1;
for (; j <= i; k++, j++) {
if (array[k] > array[j]) {
exchangeValue(array, k, j);
}
}
}
}
private void exchangeValue(int array[], int indexA, int indexB) {
int temp = array[indexB];
array[indexB] = array[indexA];
array[indexA] = temp;
}
private void printArray(int array[]) {
for (int i = 1; i < array.length; i++) {
System.out.print("i = " + i + ", value = " + array[i] + "\n");
}
}
}