diff --git a/Java/array_binary_int.java b/Java/array_binary_int.java new file mode 100644 index 0000000..b2b2166 --- /dev/null +++ b/Java/array_binary_int.java @@ -0,0 +1,55 @@ + +import java.util.Scanner; +public class array_binary_int +{//ascending + int arr[],n,i,ele; + void input() + { + Scanner sc=new Scanner(System.in); + System.out.println("enter limit of array"); + n=sc.nextInt(); + arr=new int[n]; + System.out.println("enter "+n+" elements"); + for(i=0;iele) + last=mid-1; + else + { + flag=true; + break; + } + } + if(flag==true) + System.out.println("found at index"+(mid+1)); + else + System.out.println("not found"); + } + public static void main(String args[]) + { + array_binary_int obj=new array_binary_int(); + obj.input(); + obj.display(); + obj.binary(); + } +} diff --git a/Java/array_bubble_char.java b/Java/array_bubble_char.java new file mode 100644 index 0000000..a1bc7eb --- /dev/null +++ b/Java/array_bubble_char.java @@ -0,0 +1,39 @@ + +import java.util.Scanner; +public class array_bubble_char +{//ascending + void bubblesort() + { + char c[],temp; + int i,j,n; + Scanner sc=new Scanner(System.in); + System.out.println("Enter number of elements"); + n=sc.nextInt(); + c=new char[n]; + System.out.println("Enter "+n+" characters"); + for(i=0;ic[j+1]) + { + temp=c[j]; + c[j]=c[j+1]; + c[j+1]=temp; + } + } + } + for(i=0;i0) + { + temp=c[j]; + c[j]=c[j+1]; + c[j+1]=temp; + } + } + } + for(i=0;i=0;i--) + { + ch=str.charAt(i); + reverse =reverse+ch; + }//end of for + System.out.println("reversed "+reverse); + if(reverse.equals(str)) + System.out.println(str+" is a palindrome string"); + else + System.out.println(str+" is NOT a palindrome string"); + + } + public static void main(String args[]) + { + string_palindrome obj = new string_palindrome(); + obj.input(); + obj.palindrome(); + } +}