P9
import java.util.Scanner;
public class BinarySearch9
int[]arr ;
int size;
int num ;
public BinarySearch9(int n)
size=n;
arr=new int[n];
static Scanner sc=new Scanner(System.in);
public void input()
System.out.println("Enter "+size+" array elements");
for(int i=0;i<size;i++)
arr[i]=sc.nextInt();
System.out.println("Enter number to be searched");
num=sc.nextInt();
public void sort( )
int i,j,temp=0;
boolean f=true;
for(i=1;i<size-1;i++)
for(j=0;j<=size-i-1;j++)
if(arr[j]>arr[j+1])
{
temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
f=false;
}//end of inner for loop
if(f==true)
break;
else
f=true;
public boolean search( )
boolean check=false;
int high,low,mid;
low=0;
high=size-1;
while(low<=high)
mid=(low+high)/2;
if(num==arr[mid])
check=true;
break;
else
if(num>arr[mid])
low=mid+1;
else
high=mid-1;
return check;
}
public void display( )
System.out.println(search()?"Number is found":"Number is not found");
public static void main()
System.out.println("enter size of array");
int n=sc.nextInt();
BinarySearch9 obj = new BinarySearch9(n);
obj.input();
obj.sort();
obj.display();
P8
import java.util.Scanner;
public class Arrange8
int[ ] arr;
int size;
public Arrange8(int n)
size=n;
arr=new int[n];
static Scanner sc=new Scanner(System.in);
public void input()
System.out.println("Enter "+size+" array elements");
for(int i=0;i<size;i++)
arr[i]=sc.nextInt();
}
public void sort()
int i,j,max,pos;
for(i=0;i<=size-2;i++)
max=arr[i];
pos=i;
for(j=i+1;j<=size-1;j++)
if(arr[j]>max)
max=arr[j];
pos=j;
if(pos!=i)
arr[pos]=arr[i];
arr[i]=max;
public void display( )
for(int i=0;i<arr.length;i++)
System.out.print(arr[i]+" ");
System.out.println();
public static void main()
{
System.out.println("Enter size of array");
int n=sc.nextInt();
Arrange8 obj = new Arrange8(n);
obj.input();
obj.sort();
System.out.println("sorted array is: ");
obj.display();
P6
import java.util.Scanner;
class ArraySumOfDigits6
int[] arr;
int size;
static Scanner sc=new Scanner(System.in);
public ArraySumOfDigits6 (int n )//parameterized constructor to initialize size=n and allocate space for the array
object.
size=n;
arr=new int[size];
public void input( )//accepts array elements and stores in the array.
System.out.println("Enter "+size+" array elements");
for(int i=0;i<size;i++)
arr[i]=sc.nextInt();
public void getSumOfDigit( )//reads the array, checks if an array value is a 3-digit number or not and calculates the
sum of digits if the value is a 3-digit number.Displays the sum
for(int i=0;i<size;i++)
int s=0;
int n=arr[i];
int d = 0;
if(arr[i]>99 && arr[i]<1000)
while(n>0)
d=n%10;
s+=d;
n/=10;
System.out.println("the number is= "+arr[i] +" and the sum is= "+ s);
public void display()
System.out.println("array elements are");
for(int i=0;i<size;i++)
System.out.print( arr[i]+" ");
System.out.println();
public static void main()
System.out.println("enter size of array");
int n=sc.nextInt();
ArraySumOfDigits6 obj = new ArraySumOfDigits6(n);
obj.input();
obj.display();
obj.getSumOfDigit();
P5
import java.util.Scanner;
public class FewMorePatterns5
public void display1(int n)
for (int i=1;i<=n;i++)
for(int j=1;j<=i;j++)
System.out.print(j+" ");
for(int k=i-1;k>=1;k--)
{System.out.print(k+" ");}
System.out.println();
public void display2(int n)
int i,j;
for (i=n;i>=1;i--)
for(j=i;j>=1;j--)
System.out.print(j+" ");
System.out.println();
public void display3()
System.out.println("Pattern 3: ");
for (int i=1;i<=5*2-1;i=i+2)
for(int j=i;j<=5*2-1;j=j+2)
System.out.print(j+" ");
for (int k=1;k<i;k=k+2)
System.out.print(k+" ");
System.out.println();
public static void main()
Scanner sc=new Scanner(System.in);
FewMorePatterns5 obj=new FewMorePatterns5();
System.out.println("Enter Number of rows for pattern 1 : ");
int m=sc.nextInt();
obj.display1(m);
System.out.println("Enter Number of rows for pattern 2 : ");
m=sc.nextInt();
obj.display2(m);
obj.display3();
P3
import java.util.Scanner;
public class SpecialNumbersInARange3
static Scanner sc=new Scanner(System.in);
int lower;
int upper;
public void input( )//This method accepts total number of terms.Display “Invalid Input” if n <=0
System.out.println("Enter the lower range");
lower=sc.nextInt();
System.out.println("Enter the upper range");
upper=sc.nextInt();
if(lower>=upper)
{
System.out.println("invalid input");
System.exit(0);
public boolean isSpecial(int num)//This method checks whether num is a Special number or not and returns true
or false accordingly.
int digit,evensum=0,oddsum=0;
while(num>0)
digit=num%10;
if(digit%2==0)
evensum+=digit;
else
oddsum+=digit;
num/=10;
return oddsum==evensum;
//This method displays all the special numbers between lower and upper limits with the help of isSpecial( ).
public void display()//
System.out.println("The special numbers in the range are ");
for(;lower<=upper;++lower)
if(isSpecial(lower))
System.out.print(lower+" ");
public static void main()
SpecialNumbersInARange3 obj=new SpecialNumbersInARange3();
obj.input();
obj.display();
}
}
P7
import java.util.Scanner;
public class ArrayReverse7
int[] a;
int size;
static Scanner sc=new Scanner(System.in);
public ArrayReverse7 (int n )//parameterized constructor to initialize size=n and allocate space for the array
object.
size=n;
a=new int[size];
public void input( )// accepts array elements and stores in the array.
System.out.println("Enter "+size+" array elements");
for(int i=0;i<a.length;i++)
a[i]=sc.nextInt();
public void reverse( )//reverses the array by swapping 1st and last values ,2nd and 2nd last values and so on.
{//start of method
for(int i=0;i<a.length/2;i++)
{//end of method
int t=a[i];
a[i]=a[a.length-i-1];
a[a.length-i-1]=t;
}//end of loop
}//end of method
public void display()
System.out.println("Reversed array elements are");
for(int i=0;i<a.length;i++)
System.out.print( a[i]+" ");
System.out.println();
public static void main()
System.out.println("enter size of array");
int n=sc.nextInt();
ArrayReverse7 obj = new ArrayReverse7 (n);
obj.input();
obj.reverse();
obj.display();
