first commit

Array-Sorting-Without-Function/jaychhatrola/BubbleSort.java

@@ -0,0 +1,46 @@
+package Ajava;
+
+import java.util.Scanner;
+
+public class BubbleSort {
+
+	static void Sorting(int bubblesort[]) {
+		int a = bubblesort.length;
+
+		for (int i = 0; i < a - 1; i++) {
+			for (int j = 0; j < a - i - 1; j++) {
+				if (bubblesort[j] > bubblesort[j + 1]) {
+					int temp = bubblesort[j];
+					bubblesort[j] = bubblesort[j + 1];
+					bubblesort[j + 1] = temp;
+				}
+			}
+
+		}
+
+		System.out.println("Sorted Array :-");
+		for (int i = 0; i < a; i++) {
+			System.out.print(" " + bubblesort[i]);
+		}
+
+	}
+
+	public static void main(String[] args) {
+
+		int n = 0;
+		Scanner sc = new Scanner(System.in);
+
+		System.out.println("Enter Array Size");
+		n = sc.nextInt();
+
+		int array[] = new int[n];
+
+		for (int i = 0; i < n; i++) {
+			array[i] = sc.nextInt();
+		}
+
+		Sorting(array);
+
+	}
+
+}

Draw-Patten-Using-Loop/jaychhatrola/a.c

@@ -0,0 +1,30 @@
+#include<stdio.h>
+
+
+void main()
+{
+		int i,j,k,a=1;
+
+	for (i=1; i<=5; i++) {
+		for (k=a; k<=5; k++) {
+			printf(" ");
+		}
+		for (j=0; j< i; j++) {
+			printf("*");
+		}
+		a = a + 1;
+		printf("\n");
+	}
+	a = 1;
+	for (i=4; i>=1; i--) {
+		for (k=a; k>=0; k--) {
+			printf(" ");
+		}
+		for (j=i; j>=1; j--) {
+			printf("*");
+		}
+		a = a + 1;
+		printf("\n");
+	}
+
+}

Draw-Patten-Using-Loop/jaychhatrola/b.c

@@ -0,0 +1,24 @@
+#include<stdio.h>
+
+
+void main()
+{
+
+	int i,j,k,c=1;
+
+
+	for(i=1;i<=5;i++)
+	{
+		for(j=1;j<=i;j++)
+		{
+
+		printf(" %d ",c++);
+
+	}
+	printf("\n");
+
+	}
+
+
+
+}

Find-Char-Occurrence/jaychhatrola/Subsequence.java

@@ -0,0 +1,51 @@
+package Ajava;
+
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class Subsequence { 
+
+	 public static void find (char[] str, String str1)
+	    {
+
+	        if (str1.length() == str.length)
+	        {
+
+	            System.out.print(str1 + " ");
+	            return;
+	        }
+
+
+	        for (int i = 0; i < str.length; i++)
+	        {
+
+	            while (i + 1 < str.length && str[i] == str[i+1]) {
+	            	i++;
+
+	            }
+
+	            find (str, str1 + str[i]);
+	        }
+	    }
+
+
+ public static void main(String[] args) 
+ { 
+
+	 Scanner sc = new Scanner(System.in);
+
+	 System.out.println("Enter String");
+
+
+	 String str = sc.nextLine();
+
+     String str1 = "";
+
+     str = str.toLowerCase();
+
+     char[] c = str.toCharArray();
+     Arrays.sort(c);
+
+     find(c, str1);
+ 	} 
+} 

Palindrome/jaychhatrola/Palidroma.java

@@ -0,0 +1,50 @@
+package Ajava;
+
+import java.util.Scanner;
+
+public class Palidroma {
+
+
+ static	int palindrome(int n)
+	{
+	  int t,r = 0;
+	  t=n;
+	  while(t!=0)
+	  {
+	    r=r*10;
+	    r=r+(t%10);
+	    t=t/10;
+	  }
+	  if(r==n)
+	    return 1;
+	  else
+	    return 0;
+	}
+
+
+
+	public static void main(String args[]) 
+	{ 
+
+
+		Scanner sc = new Scanner(System.in);
+
+		  int k,d=0,i;
+		  System.out.println("Enter Number");
+		  k=sc.nextInt();
+		  i = k + 1;
+		  while(true)
+		  {
+		    d=palindrome(i);
+
+		    if(d==1)
+		      break;
+		    i++;
+		  }
+		  System.out.println(i);
+
+
+	}
+	} 
+
+

String-Operation/JayChhatrola/Stringoperation.java

@@ -0,0 +1,51 @@
+import java.util.Scanner;
+
+public class Stringoperation {
+
+
+	static final int TotalChar = 256; 
+
+
+    static void findDuplicate(String str, int[] c) 
+    { 
+       for (int i = 0; i < str.length();  i++) 
+          c[str.charAt(i)]++; 
+    } 
+
+     static void printDuplicate(String str) 
+    { 
+       int count[] = new int[TotalChar]; 
+       findDuplicate(str, count); 
+
+      for (int i = 0; i < TotalChar; i++) 
+        if(count[i] > 1) 
+            System.out.printf("%c,  Number Of Count = %d \n", i,  count[i]); 
+
+    } 
+
+
+	public static void main(String[] args) {
+
+		 String input = "";
+
+		 Scanner sc = new Scanner(System.in);
+
+		 System.out.println("Enter String");
+		 input = sc.nextLine();
+
+
+		 printDuplicate(input); 
+
+
+
+
+
+
+
+
+
+
+	}
+
+
+}