Page 569 - ComputerScience_Class_11

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

25 {
26 for(int j=0;j<n-1-i;j++)

27 {
28 if(ar[j]>ar[j+1]) //sorting in ascending order

29 {
30 int t=ar[j];

31 ar[j]=ar[j+1];

32 ar[j+1]=t;
33 }

34 }
35 }

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

38 System.out.println(ar[i]);
39 }

40
41 void binary_search()

42 {
43 Scanner sc= new Scanner(System.in);

44 System.out.println("ENTER THE NUMBER TO BE SEARCHED");
45 sno=sc.nextInt();

46 int min=0, max=(n-1),mid=0,p=-1;

47 while(min<=max&&p==-1) //searching the user given number
48 {

49 mid=(min+max)/2;
50 if(ar[mid]==sno)

51 p=mid;
52 else if(ar[mid]>sno)

53 max=mid-1;
54 else

55 min=mid+1;

Internal Assessment 567