Java下实现快速排序

【文章标题】 <!-- /* Font Definitions */ @font-face {font-family:宋体; panose-1:2 1 6 0 3 1 1 1 1 1; mso-font-alt:SimSun; mso-font-charset:134; mso-generic-font-family:auto; mso-font-pitch:variable; mso-font-signature:3 135135232 16 0 262145 0;} @font-face {font-family:"/@宋体"; panose-1:2 1 6 0 3 1 1 1 1 1; mso-font-charset:134; mso-generic-font-family:auto; mso-font-pitch:variable; mso-font-signature:3 135135232 16 0 262145 0;} /* Style Definitions */ p.MsoNormal, li.MsoNormal, div.MsoNormal {mso-style-parent:""; margin:0cm; margin-bottom:.0001pt; text-align:justify; text-justify:inter-ideograph; mso-pagination:none; font-size:10.5pt; mso-bidi-font-size:12.0pt; font-family:"Times New Roman"; mso-fareast-font-family:宋体; mso-font-kerning:1.0pt;} /* Page Definitions */ @page {mso-page-border-surround-header:no; mso-page-border-surround-footer:no;} @page Section1 {size:612.0pt 792.0pt; margin:72.0pt 90.0pt 72.0pt 90.0pt; mso-header-margin:36.0pt; mso-footer-margin:36.0pt; mso-paper-source:0;} div.Section1 {page:Section1;} --> Java 下实现快速排序

【文章作者】曾健生

【作者邮箱】 zengjiansheng1@126.com

【作者 QQ 】 190678908

【作者 MSN 】 zengjiansheng1@hotmail.com

【作者博客】 blog.csdn.net/newjueqi

package com.newjueqi.servlet; public class QuickSort { public void quick(int array[],int low, int high) { int mid; if( low<high ) { mid=quickPass( array, low , high ); quick( array, low, mid-1 ); quick( array, mid+1, high ); } } private int quickPass(int[] array, int low, int high) { int up=high; int down=low; int temp=array[low]; while( down<up ) { while( down<up && array[up]>=temp ) { up--; } if( down<up ) { array[down++]=array[up]; } while( down<up && array[down]<=temp ) { down++; } if( down<up ) { array[up--]=array[down]; } } array[down]=temp; return down; } public static void main(String args[]) { QuickSort quickSort=new QuickSort(); int array[]={8,9,1,2,3,4,5,6,7}; quickSort.quick(array, 0, array.length-1); for(int i=0;i<array.length;i++) { System.out.println(array[i]); } } }