| 쉘정렬 개념 | 쉘정렬 알고리즘 | 쉘정렬 분석 |

쉘 정렬 알고리즘

------------------------------------------------------

void Shellsort(int A[], int N)

{

int i, j, Increment;

int Tmp;

for(Increment=N/2; Increment>0; Increment/=2)

for(i=Increment; i<N; i++)

{

Tmp=A[i];

for(j=i; j>=Increment; j-=Increment)

if(Tmp < A[j-Increment])

A[j]=A[j-Increment];

else

break;

A[j]=Tmp;

}

}

------------------------------------------------------