计数排序

来源：互联网发布：淘宝退货时间规定编辑：程序博客网时间：2024/05/21 05:05

package

import java.util.Random;

/**
* Copyright 2015年5月11日 by
*
* All Rights Reserved
*
* @Package
* @Title: CountSort.java
* @author
* @date 2015年5月11日下午10:41:30
*/
public class CountSort
{

public static void main(String[] args)
{
int k = 0;
while (k < 1000)
{
CountSort cs = new CountSort();
Integer[] toBeSortedData = cs.createArray(10, 100);
// Integer[] toBeSortedData = { -419804243, -1912988136, -574062376,
// -81486055, 1931432974 };
System.out.println("\n 排序前的数组：");
ArrayUtil.printArray(toBeSortedData);
Integer[] haveSoredArray = cs.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)
{
int maxValue = getMaxValue(beSorted);
int minValue = getMinValue(beSorted);
Integer[] beSettingArray = new Integer[maxValue - minValue + 2];
for (int j = 0; j < beSettingArray.length; j++)
{
beSettingArray[j]=0;
}
for (int i = 0; i < beSorted.length; i++)
{
beSettingArray[beSorted[i] - minValue] += 1;
}
for (int j = 0, i = 0; j < beSettingArray.length; j++)
{
int currentValue = beSettingArray[j];
while (currentValue > 0)
{
beSorted[i] = j+minValue;
i++;
currentValue--;
}
}

return beSorted;
}

private Integer getMaxValue(Integer[] beSorted)
{
int max = Integer.MIN_VALUE;
for (Integer value : beSorted)
{
if (value >= max)
{
max = value;
}
}
return max;
}

private Integer getMinValue(Integer[] beSorted)
{
int min = Integer.MAX_VALUE;
for (Integer value : beSorted)
{
if (value <= min)
{
min = value;
}
}
return min;
}

private Integer[] createArray(int length, int max)
{
Integer[] beSorted = new Integer[length];
Random random = new Random();
for (int i = 0; i < length; i++)
{
beSorted[i] = random.nextInt(max);
}
return beSorted;
}

}

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;

}
}

0 0