Shell Sort in Data Structures using Java

Program 1

import java.util.*;
class ShellSort
{
      public static void main(String args[])
      {
          int a[],n,i;
          Scanner scan=new Scanner(System.in);
          System.out.println("Enter the limit of array: ");
          n=scan.nextInt();
          a=new int[n];
          System.out.println("Enter element in array");
           for(i=0;i<n;i++)
                 a[i]=scan.nextInt();

          shellsort_method(a,n);
          System.out.println("---------Sorted elements:-------------- ");
          for(i=0;i<n;i++)
           System.out.println(a[i]);
      }
      public static void shellsort_method(int a[],int n)
    {
                int gap,i,j,temp;
               for(gap=n/2;gap>=1;gap=gap/2)   //gap
               {
                  for(j=gap;j<n;j++)   //j
                  {
                       for(i=j-gap;i>=0;i=i-gap)  //i
                       {
                          if(a[i+gap]<a[i])
                          {
                            temp=a[i+gap];
                              a[i+gap]=a[i];
                              a[i]=temp;
                          }
                          else
                              break;
                       }
                  }
               } 
    }

}