JAVA PROGRAMMING

Posts

Showing posts from October, 2018

WAP TO MERGE TWO ARRAY INTO SINGLE DIMENSION ARRAY

October 25, 2018

import java.util.*; class mergeapc { public static void main(String args[]) { int n,i,m,p; Scanner sc=new Scanner(System.in); System.out.println("Enter the no.of element for A"); n=sc.nextInt(); System.out.println("Enter the no.of element FOR B"); m=sc.nextInt(); System.out.println("Enter the no.of element FOR C"); p=sc.nextInt(); int a[]=new int[n]; int b[]=new int[m]; int c[]=new int[p]; System.out.println("Enter the array element for 1st"); for(i=0;i<n;i++) { a[i]=sc.nextInt(); } System.out.println("Enter the array element for 2nd"); for(i=0;i<m;i++) { b[i]=sc.nextInt(); } for(i=0;i<n;i++) {

WAP IN JAVA TO INSERT AN ELEMENT IN AN ARRAY

October 25, 2018

import java.util.*; class INSERT { public static void main(String args[]) { int n,t,j,i,p; Scanner sc=new Scanner(System.in); System.out.println("Enter the no.of element"); n=sc.nextInt(); int a[]=new int[50]; System.out.println("Enter the array element"); for(i=0;i<n;i++) { a[i]=sc.nextInt(); } System.out.println("Enter the ELEMENT to INSERTED"); int ins=sc.nextInt(); System.out.println("Enter the position to insert"); p=sc.nextInt(); for(i=n;i>p;i--) { a[i]=a[i-1]; } a[p]=ins; System.out.println("ARRAY element in inserted order"); for(i=0;i<n+1;i++) { System.out.println(a[i]); }

WAP TO DELETE AN ELEMENT IN AN ARRAY

October 25, 2018

import java.util.*; class delete { public static void main(String args[]) { int n,t,j,i,p; Scanner sc=new Scanner(System.in); System.out.println("Enter the no.of element"); n=sc.nextInt(); int a[]=new int[n]; System.out.println("Enter the array element"); for(i=0;i<n;i++) { a[i]=sc.nextInt(); } System.out.println("Enter the position to delete"); p=sc.nextInt(); for(i=0;i<n;i++) { if(a[i]==p) { for(j=i;j<n-1;j++) { a[j]=a[j+1]; } n--; i--; } } System.out.println("ARRAY element in DELETED order"); for(i=

WAP IN JAVA TO FIND THE MAXIMUM AND MINIMUM ELEMENT IN AN ARRAY

October 25, 2018

import java.util.*; class MAX_MIN { public static void main(String args[]) { int n,i,max,min; Scanner sc=new Scanner(System.in); System.out.println("Enter the number"); n=sc.nextInt(); int a[]=new int[n]; System.out.println("Enter the array element"); for(i=0;i<n;i++) { a[i]=sc.nextInt(); } max=a[0]; min=a[0]; for(i=1;i<n;i++) { if(a[i]>max) { max=a[i]; } else { min=a[i]; } } System.out.println("Maximum element="+max); System.out.println("Minimum element="+min); } } OUTPUT: Enter the number 5 Enter the array element 1 2 3 4 5 Maximum element=5 Minimum element=1

WAP TO SEARCH THE ELEMENT I AN GIVEN ARRAY USING BINARY SEARCH

October 25, 2018

import java.util.*; class BINARY { public static void main(String args[]) { int n,s,i,f=0,lb,ub,mid; Scanner sc=new Scanner(System.in); System.out.println("Enter the number"); n=sc.nextInt(); int a[]=new int[n]; System.out.println("Enter the array element"); for(i=0;i<n;i++) { a[i]=sc.nextInt(); } System.out.println("Enter the searched element"); s=sc.nextInt(); lb=0; ub=n-1; while(lb<=ub) { mid=(lb+ub)/2; if(a[mid]==s) { System.out.println(s+ "element is found at position="+(mid+1)); f=1; break; } if(a[mid]>s) { ub=mid-1; } else { lb=mid+1; } } if(f=

WAP TO SEARCH THE ELEMENT IN AN GIVEN ARRAY USING LINEAR SEARCH

October 25, 2018

import java.util.*; class linear { public static void main(String args[]) { int n,s,i,f=0; Scanner sc=new Scanner(System.in); System.out.println("Enter the number"); n=sc.nextInt(); int a[]=new int[n]; System.out.println("Enter the array element"); for(i=0;i<n;i++) { a[i]=sc.nextInt(); } System.out.println("Enter the searched element"); s=sc.nextInt(); for(i=0;i<n;i++) { if(a[i]==s) { f=1; break; } } if(f==1) { System.out.println("element is found="+a[i]); System.out.println("Position of the element="+(i+1)); } else { System.out.println("ELEMENT IS NOT FOUND"); } } }

WAP TO SORT THE GIVEN ARRAY USING INSERTION SORT

October 25, 2018

import java.util.*; class insersort { public static void main(String args[]) { Scanner sc= new Scanner(System.in); int a[]=new int[50]; int n,i,temp,j; System.out.print("Enter the number of elements"); n=sc.nextInt(); System.out.print("Enter the numbers"); for(i=0;i<n;i++) { a[i]=sc.nextInt(); } for ( i = 1 ; i <n ; i++ ) { for ( j = 0 ; j < i ; j++ ) { if ( a[j] > a[i] ) { temp=a[i]; a[i]=a[j]; a[j]=temp; } } } System.out.print("After sorting "); for(i=0;i<n;i++) { System.out.println(a[i]); } } } OUTPUT: Enter the number of elements5 Enter the numbers6 0 4 1 9 After sorting 0 1 4 6 9

WAP IN JAVA TO SORT THE ELEMENT IN ASCENDING ORDER USING BUBBLE SORT

October 25, 2018

import java.util.*; class bubblesort { public static void main(String args[]) { int n,t,j,i; Scanner sc=new Scanner(System.in); System.out.println("Enter the no.of element"); n=sc.nextInt(); int a[]=new int[n]; System.out.println("Enter the array element"); for(i=0;i<n;i++) { a[i]=sc.nextInt(); } for(i=0;i<n-1;i++) { for(j=0;j<n-i-1;j++) { if(a[j]>a[j+1]) { t=a[j]; a[j]=a[j+1]; a[j+1]=t; } } } System.out.println("ARRAY element in sorted order"); for(i=0;i<n;i++) { System.out.println(a[i]);

WAP IN JAVA TO SORT AN GIVEN ELEMENT IN AN ARRAY USING SELECTION SORT

October 25, 2018

import java.util.*; class selection { public static void main(String args[]) { int n,t,j,i; Scanner sc=new Scanner(System.in); System.out.println("Enter the no.of element"); n=sc.nextInt(); int a[]=new int[n]; System.out.println("Enter the array element"); for(i=0;i<n;i++) { a[i]=sc.nextInt(); } for(i=0;i<n-1;i++) { for(j=i+1;j<n;j++) { if(a[i]>a[j]) { t=a[i]; a[i]=a[j]; a[j]=t; } } } System.out.println("ARRAY element in sorted order"); for(i=0;i<n;i++) { System.out.println(a[i]); }