基数排序

package  


import java.util.Random;


 


/**
 * Copyright 2015年5月12日 by  
 *
 * All Rights Reserved
 *
 * @Package yongbo.tan.algorithm.sort.imp
 * @Title: RadixSort.java
 * @author  
 * @date 2015年5月12日 下午10:41:47
 */
public class RadixSort  
{


    public static void main(String[] args)
    {
int k = 0;
while (k < 1000)
{
   RadixSort rs = new RadixSort();
    Integer[] toBeSortedData = rs.createArray(77, 100);
//    Integer[] toBeSortedData = { 87, 24, 88, 33, 64, 85, 13, 43, 20, 67 };
   System.out.println("\n 排序前的数组：");
   ArrayUtil.printArray(toBeSortedData);
   Integer[] haveSoredArray = rs.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 numberLength = getNumberLength(maxValue);
for (int i = 0; i <= numberLength; i++)
{
   for (int index = 0, step = 0; step < beSorted.length - index; index++)
   {
int max = beSorted[0];
int positionmax = getPositionValueFromRightToLeft(max, i);
for (int nextIndex = 1; nextIndex < beSorted.length - index; nextIndex++)
{
   int nextIndexValue = beSorted[nextIndex];


   int nextPositionIndexValue = getPositionValueFromRightToLeft(
   nextIndexValue, i);
   if (positionmax > nextPositionIndexValue)
   {
int temp = max;
beSorted[nextIndex - 1] = nextIndexValue;
beSorted[nextIndex] = temp;
   }
   else
   {
max = nextIndexValue;
positionmax=nextPositionIndexValue;
   }


}


   }
}


return beSorted;
    }


    private int getPositionValueFromRightToLeft(int value, int postion)
    {
String valueString = String.valueOf(value);
if (valueString.length() > postion)
{
   return Integer.valueOf(valueString.charAt(valueString.length()-postion-1) + "");
}
return 0;
    }


    private int getPositionValueFromLeftToRight(int value, int postion)
    {
String valueString = String.valueOf(value);
if (valueString.length() > postion)
{
   return Integer.valueOf(valueString.charAt(postion) + "");
}
return 0;
    }
    
    private int getNumberLength(int value)
    {
int radix = getRadix();
int remainder = value / radix;
int length = 0;
while (remainder > 0)
{
   length++;
   remainder = remainder / 10;
}
return length;
    }


    private int getRadix()
    {


return 10;
    }


    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;


    }
}