Page 570 - Computer science 868 Class 12
P. 570

18           }
                19       void void bubble()

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

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

                24                   {
                25       if(ar[j]>ar[j+1])
                26                       {

                27       int t=ar[j];
                28       ar[j]=ar[j+1];

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

                31                   }
                32               }

                33       System.out.println("THE SORTED ARRAY IS:-");
                34       for(int i=0;i<n;i++)

                35       System.out.println(ar[i]);
                36           }

                37       void binary_search()
                38           {

                39       System.out.println("ENTER NUMBER TO BE SEARCHED");
                40       sno=sc.nextInt();

                41       int min=0,max=n-1,mid=0,p=-1;
                42       while(min<=max && p==-1)

                43               {
                44       mid=(min+max)/2;

                45       if(ar[mid]==sno)
                46                   p=mid;
                47       else if(ar[mid]>sno)

                48       max=mid-1;

                49       else
                50       min=mid+1;
                51               }





                568568  Touchpad Computer Science-XII
   565   566   567   568   569   570   571   572   573   574   575