合并排序错误 static int n = 10;static float A[] = new float[n];static float B[] = new float[n];public static void mergeSort(float A[],int left,int right ){if(left < right){ int mid = (left + right) / 2;mergeSort(A,left,mid);mergeSort(A,mid + 1,

合并排序错误 static int n = 10;static float A[] = new float[n];static float B[] = new float[n];public static void mergeSort(float A[],int left,int right ){if(left < right){ int mid = (left + right) / 2;mergeSort(A,left,mid);mergeSort(A,mid + 1,
合并排序错误
static int n = 10;
static float A[] = new float[n];
static float B[] = new float[n];
public static void mergeSort(float A[],int left,int right )
{
if(left < right)
{
int mid = (left + right) / 2;
mergeSort(A,left,mid);
mergeSort(A,mid + 1,right);
merge(A,B,left,mid,right);
copy(A,B,left,right);
}
}
private static void merge(float A[],float B[],int left,int mid,int right)
{
int i = left,j = mid + 1,k = left;
while(i

合并排序错误 static int n = 10;static float A[] = new float[n];static float B[] = new float[n];public static void mergeSort(float A[],int left,int right ){if(left < right){ int mid = (left + right) / 2;mergeSort(A,left,mid);mergeSort(A,mid + 1,
static int n = 10;
static float A[] = new float[n];
static float B[] = new float[n];
public static void mergeSort(float A[],int left,int right )
{
if(left < right)
{
int mid = (left + right) / 2;
mergeSort(A,left,mid);
mergeSort(A,mid + 1,right);
merge(A,B,left,mid,right);
copy(A,B,left,right);
}
}
private static void merge(float A[],float B[],int left,int mid,int right)
{
int i = left,j = mid + 1,k = left;
while(i