import java.util.Random;
/**
* Copyright 2015年5月9日 by
*
* All Rights Reserved
*
* @Package yongbo.tan.algorithm.sort.imp
* @Title: DivideCombineSort.java
* @author
* @date 2015年5月9日 下午12:02:40
*/
public class DivideCombineSort
{
public static void main(String[] args)
{
int k = 0;
while (k < 1000)
{
DivideCombineSort dcs = new DivideCombineSort();
Integer[] toBeSortedData = ArrayUtil.createIntergerArrays(
new Random(), 3);
// Integer[] toBeSortedData = { -419804243, -1912988136, -574062376,
// -81486055, 1931432974 };
System.out.println("\n 排序前的数组:");
ArrayUtil.printArray(toBeSortedData);
Integer[] haveSoredArray = dcs.sort(toBeSortedData);
System.out.println("\n 排序后的数组:");
ArrayUtil.printArray(haveSoredArray);
if (ArrayUtil.isSortedArray(haveSoredArray))
{
System.out.println("\n 排序算法正确");
}
else
{
System.err.println("\n 排序算法错误");
}
k++;
}
}
@Override
public Integer[] sort(Integer[] beSorted)
{
if (beSorted.length <= 1 || beSorted == null)
{
return beSorted;
}
divideMergeSort(beSorted, 0, beSorted.length - 1);
return beSorted;
}
private void divideMergeSort(Integer[] beSorted, int start, int end)
{
if (start == end)
{
return;
}
int middle = (start + end) / 2;
divideMergeSort(beSorted, start, middle);
divideMergeSort(beSorted, middle + 1, end);
try
{
mergeSort(beSorted, start, middle, middle + 1, end);
}
catch (IllegalAccessException e)
{
System.out.println("\n exception occur,because " + e.getMessage()
+ " 。");
}
}
private void mergeSort(Integer[] beSorted, int firstStart, int firstEnd,
int secondStart, int secondEnd) throws IllegalAccessException
{
if (secondStart < firstEnd)
{
throw new IllegalAccessException(secondStart + "must greater than "
+ firstEnd);
}
for (int secondIndex = secondEnd; secondIndex >= secondStart; secondIndex--)
{
int secondIndexValue = beSorted[secondIndex];
int tempSecondIndex = secondIndex;
for (int firstIndex = firstEnd; firstIndex >= firstStart; firstIndex--)
{
int firstIndexValue = beSorted[firstIndex];
if (secondIndexValue >= firstIndexValue)
{
break;
}
else
{
ArrayUtil.swap(beSorted, tempSecondIndex, firstIndex);
tempSecondIndex = firstIndex;
}
}
}
}
private int binarySearch(Integer[] sortedArray, int start, int end,
int searchValue)
{
if (sortedArray[end] <= searchValue)
{
return end + 1;
}
if (searchValue <= sortedArray[start])
{
return start - 1;
}
int middle = (start + end) / 2;
if (searchValue > sortedArray[middle])
{
return binarySearch(sortedArray, middle + 1, end - 1, searchValue);
}
else
{
if (searchValue < sortedArray[middle])
{
return binarySearch(sortedArray, start + 1, middle - 1,
searchValue);
}
else
{
return middle + 1;
}
}
}
}
package
import java.util.Random;
/**
* Copyright 2015年5月3日 by
*
* All Rights Reserved
*
* @Package
* @Title: ArrayUtil.java
* @author
* @date 2015年5月3日 上午9:01:23
*/
public class ArrayUtil
{
public static boolean isSortedArray(int[] test)
{
int i = 0;
int j = 1;
while (j < test.length)
{
if (test[i] > test[j])
{
return false;
}
i++;
j++;
}
return true;
}
public static int[] createIntArrays(Random random, int size)
{
int[] intArray = new int[size];
for (int i = 0; i < intArray.length; i++)
{
intArray[i] = random.nextInt();
}
return intArray;
}
public static void printArray(int[] t)
{
System.out.println("array size is: " + t.length + " values are:");
for (int i : t)
{
System.out.print(i + " ");
}
}
public static boolean isSortedArray(Integer[] test)
{
int i = 0;
int j = 1;
while (j < test.length)
{
if (test[i] > test[j])
{
System.out.println("\n 前一个值:" + test[i] + "大于" + "后一个值:"
+ test[j]);
return false;
}
i++;
j++;
}
return true;
}
public static Integer[] createIntergerArrays(Random random, int size)
{
Integer[] intArray = new Integer[size];
for (int i = 0; i < intArray.length; i++)
{
intArray[i] = random.nextInt();
}
return intArray;
}
public static void printArray(Integer[] t)
{
System.out.println("array size is: " + t.length + " values are:");
for (int i : t)
{
System.out.print(i + " ");
}
}
public static void swap(Integer[] beSorted, int big, int little)
{
int temp = beSorted[big];
beSorted[big] = beSorted[little];
beSorted[little] = temp;
}
}