Page 408 - Cs_withBlue_J_C11_Flipbook
P. 408
19 void sort()
20 { // Sorting in ascending order using bubble sort
21 int t;
22 for(int i=0;i<n-1;i++)
23 {
24 for(int j =0;j<n-1-i;j++)
25 {
26 if (arr[j]>arr[j+1])
27 {
28 t=arr[j];
29 arr[j]=arr[j+1];
30 arr[j+1]=t;
31 }
32 }
33 }
34 System.out.println("Sorted array");
35 for(int k=0;k<n;k++) {
36 System.out.print(arr[k]+" " );
37 }
38 System.out.println();
39 }
40 int bin_search(int l,int u, int v )
41 {
42 int m=(l+u)/2;
43 if(arr[m]==v) // if found
44 return m;
45 else if(l>u) // if lower limit > upper limit
46 return -1;
47 else if(arr[m]>v) // number is less than the number in the middle
48 return bin_search(l,m-1,v);
49 else
50 return bin_search(m+1,u,v);
406406 Touchpad Computer Science-XI

