Page 598 - Computer science 868 Class 12
P. 598

16            arr[i]=sc.nextInt();
                17         }

                18         void sort()
                19         {  // Sorting in ascending order using bubble sort
                20            int t;

                21            for(int i=0;i<n-1;i++) {

                22
                23            for(int j =0;j<n-1-i;j++)
                24            {

                25               if (arr[j]>arr[j+1])

                26               {
                27                  t=arr[j];
                28                  arr[j]=arr[j+1];

                29                  arr[j+1]=t;
                30               }

                31            }
                32            System.out.println("Sorted array");

                33            for(int i=0;i<n;i++)
                34            { System.out.print(arr[i]+" " );}

                35            System.out.println();
                36         }

                37         int bin_search(int l,int u, int v )
                38         {

                39            int m=(l+u)/2;
                40            if(arr[m]==v)   // if found

                41              return m;
                42            else if(l>u)   // if lower limit > upper limit

                43              return -1;
                44            else if (arr[m]>v)    // number is less than the number in middle

                45              return bin_search(l,m-1,v);
                46            else

                47              return bin_search(m+1,u,v); // number is greater than the number in middle
                48         }
                49         public static void main(int s,int v)





                596596  Touchpad Computer Science-XII
   593   594   595   596   597   598   599   600   601   602   603