walk-in drive 6 and 7 sept 2018 set 1 programs...

walk-in drive 6 and 7 sept 2018 set 1 programs...

##program 3 :..........searching array element in givin array if avilable then print index value if not avilable insert it into the array......

import java.util.*;
class array1{
public static void main(String arg[]){
Scanner sc=new Scanner(System.in);
System.out.println("Enter the size of Array");
int n=sc.nextInt();
int arr[]=new int[n];
int arr1[]=new int[2+n];
for (int i=0;i<n;i++){
arr[i]=sc.nextInt();
}
System.out.println("enter insert value: ");
int a=sc.nextInt();
int count=0;
for(int j=0; j<arr.length; j++){
if(a==arr[j]){
count=1;
System.out.println("this number is also available");
break;
}
}
if(count==0){
for(int k=0;k<arr.length;k++){
arr1[k]=arr[k];
if(k==n-1){
arr1[n]=a;
}
}
}
if(count==1){
for(int x=0;x<=n-1;x++){
System.out.println(arr[x]);
}
}
else{
for(int x=0;x<=n;x++)
{
System.out.println(arr1[x]);
}
}
}
}

# program 2 : selection sort.

import java.util.*;
import java.util.Arrays;
class selection_sort{
public static void main(String arg[]){
int i,j,n,k;

Scanner sc=new Scanner(System.in);
System.out.print("Enter the no of element\t");
n=sc.nextInt();
int[] arr=new int[n];
for(i=0;i<n;i++){
arr[i]=sc.nextInt();

}
for(i=0;i<n-1;i++){
k=i;
for(j=i+1;j<n;j++){
if(arr[j]<arr[k]){
k=j;

}
}
int temp = arr[k];
arr[k]=arr[i];
arr[i]=temp;
}
System.out.print("Sorted array is:- ");
for(i=0;i<n;i++){
System.out.print(arr[i]+" ");
}

}
}

program 1 :.........................array adition:

import java.util.*;
class innotical{
public static void main(String arg[]){
String arr1[]={"a","b","c","d","e"};
String arr2[]={"1","2","3","4","5"};
String arr3[]=new String[5];
for(int i=0;i<5;i++){
arr3[i]=arr2[i]+arr1[i];
}
System.out.print("String array is : ");
for(int i=0;i<5;i++){
System.out.print(arr3[i]);
}
}
}