Page 575 - Computer science 868 Class 12
P. 575

19          }
                   20      }

                   21      void sort() //sort the given array
                   22      {
                   23      int val,p;

                   24      for(int i=1;i<n;i++)  // outer loop

                   25      {
                   26
                   27      val=ar[i];

                   28      p=i-1;
                   29      while(p>=0&&ar[p]>val)  // shifting data

                   30      {
                   31      ar[p+1]=ar[p];

                   32      p--;
                   33      }

                   34      ar[p+1]=val;  // inserting sorted data
                   35          }

                   36      }
                   37      void display() //display the sorted array

                   38      {
                   39      System.out.println("THE SORTED IS :");

                   40      for(int i=0;i<n;i++)
                   41      {

                   42      System.out.print(ar[i]+ " ");
                   43          }

                   44      }
                   45      public static void main()

                   46      {
                   47      Insertion_sort ob=new Insertion_sort();
                   48      ob.accept();

                   49      ob.sort();

                   50      ob.display();
                   51          }  //end of main
                   52      }  //end of class





                                                                                                                       573
                                                                                                   Internal Assessment  573
   570   571   572   573   574   575   576   577   578   579   580