|
e((i < h) && (j < m))
{
if(U[i] < V[j])
{
S[k] = U[i];
i++;
}
else
{
S[k] = V[j];
j++;
}
k++;
}
if(i >= h)
{
for(i = k; j < m; i++, j++) // copy V[j] t/hrough V[m] to S[k] through S[h + m]
S[i] = V[j];
}
else
{
for(j = k; i < h; i++, j++) // copy U[i] THROUGH U[h] to S[k] through
|
|
|
mergeSort(int A[], int ArrayLength)
{
int i, j=0;
int s = 1;
int ExtraArray[11];
printf("------------------합병 정렬 중 ------------------ \n\n");
while(s<ArrayLength)
{
printf("%d스텝 = ",++j );
mergePass(A,ExtraArray,ArrayLength,s);
s*=2;
printf("%d스텝 = ",++j);
mergePass(ExtraArray,A,ArrayLen
|
|
|
sorted[k++] = list[l];
else /* 남아있는레코드의일괄복사*/
for(l=i; l<=mid; l++)
sorted[k++] = list[l];
/* 배열sorted[]의리스트를배열list[]로재복사*/
for(l=left; l<=right; l++)
list[l] = sorted[l];
}
void mergeSort(int list[], int left, int right)
{
int mid;
if(left<right){
mid = (lef
|
|
|
SortedArray(num);
return 0;
}
/******************************************
To make sorted list
******************************************/
void SortedArray(int n)
{
int *d;
d = new int[n];
for(int i=0; i<10000; i++)
{
d[i] = i;
}
InsertionSort(d, n);
HeapSort(d,
|
|
|
|
import java.util.*;
public class MergeSort {
public static void main
(String[] args){
int[] array = new int[100];
Random rand = new Random();
for(int i = 0; i<array.length; i++){
array[i] = rand.nextInt(30);
}
|
|
메뉴펼치기
