看了这么多文章，没有一个快速排序能跑起来的

static void myquickSort(int[] arr,int left , int right) {
            int i=left;
			int j=right;
			int shaobing = arr[i];
			
			int temp;
			
			while(i<j) {
				while(i<j && arr[i] <= shaobing )
					i++;
				while(arr[j]>shaobing )
					j--;
				if(i< j) {
				temp = arr[i];
				arr[i] = arr[j];
				arr[j] = temp;
			}
		}
		
			arr[left] = arr[j];
			arr[j] = shaobing;
			
			if(left < j-1)
			myquickSort(arr, left, j-1);
			if(right > j+1)
			myquickSort(arr, j+1, right);
			
		}