Shall Sort | Data Structure

 

Logic of Shall sort

void shall-sort(int a[50],int n)

{

int d,temp,i,flag;

d=n/2;

while(d>=1)

{

flag=0;

for(i=0;i<n-d;i++)

{

if(a[i]>a[i+d])

{

temp=a[i];

a[i]=a[i+d];

a[i+d]=temp;

flag=1;

}

}

if(flag==0)

{

d=d/2;

}

}

}