快速排序

package  


import java.util.Random;


 


/**
 * Copyright 2015年5月6日 by  
 *
 * All Rights Reserved
 *
 * @Package  
 * @Title: QuickSort.java
 * @author 
 * @date 2015年5月6日 下午8:21:08
 */
public class QuickSort  
{
    public static void main(String[] args)
    {


int k = 0;
while (k < 1000)
{
   QuickSort qs = new QuickSort();
   Integer[] toBeSortedData = ArrayUtil.createIntergerArrays(
   new Random(), 10);
   // Integer[] toBeSortedData = { -419804243, -1912988136, -574062376,
   // -81486055, 1931432974 };
   System.out.println("\n 排序前的数组：");
   ArrayUtil.printArray(toBeSortedData);
   Integer[] haveSoredArray = qs.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 left = 0;
int right = beSorted.length - 1;
int spiltPos = getSpiltPosition(beSorted.length,left);

return quickSort(left, right,spiltPos, beSorted, beSorted.length);
    }


    private Integer[] quickSort(int left, int right, int spiltPos,
   Integer[] beSorted, int length)
    {
if (length <= 1)
{
   return beSorted;
}


int leftPos = left;
int rightPos = right;
int beforeSpiltPos = spiltPos;
int spiltValue = beSorted[beforeSpiltPos];
for (; leftPos < rightPos;)
{
   int leftValue = beSorted[leftPos];
   int rightValue = beSorted[rightPos];
   if (leftValue < spiltValue)
   {
leftPos++;
   }
   if (rightValue >= spiltValue)
   {
rightPos--;
   }
   if (leftValue >= spiltValue && rightValue < spiltValue)
   {
ArrayUtil.swap(beSorted, leftPos, rightPos);
if (leftPos == beforeSpiltPos)
{
   beforeSpiltPos=rightPos;
}
leftPos++;
rightPos--;
   }


}
if (beSorted[rightPos] >= spiltValue)
{
   ArrayUtil.swap(beSorted, beforeSpiltPos, rightPos);
   beforeSpiltPos = rightPos;
}
else
{
   ArrayUtil.swap(beSorted, beforeSpiltPos, rightPos + 1);
   beforeSpiltPos = rightPos + 1;
}


try
{
   quickSort(beforeSpiltPos + 1, right, getSpiltPosition(right
   - beforeSpiltPos,beforeSpiltPos + 1), beSorted, right - beforeSpiltPos);
}
catch (Exception e)
{
   System.out.println("\n occur exception " + e.getMessage());
}
try
{
   quickSort(left, beforeSpiltPos - 1,
   getSpiltPosition(beforeSpiltPos - left,left), beSorted,
   beforeSpiltPos - left);
}
catch (Exception e)
{
   System.out.println("\n occur exception " + e.getMessage());
}


return beSorted;


    }


    private int getSpiltPosition(int length,int min) throws IllegalArgumentException
    {
if (length <= 0)
{
   throw new IllegalArgumentException(
   "intput Vaule must greater than 0,now the input value is :"
   + length);
}
int randomValue=creatRandomMachine().nextInt(length);
 
return randomValue+min;
    }


    private Random creatRandomMachine()
    {
return new Random();
    }

}

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;


    }
}