Add files via upload

pradeepkumar24rk · web-flow · commit bdd460fbd086 · 2023-06-15T09:09:26.000+05:30
diff --git a/Sorting Algorithm in java/BubbleSort.java b/Sorting Algorithm in java/BubbleSort.java
@@ -0,0 +1,21 @@
+public class BubbleSort {
+    public static void main(String[] args) {
+        int arr[]={4,1,3,9,7};
+        int n=arr.length;
+        for(int i=0;i<n;i++){
+            int k=n;
+            for(int j=0;j<k-1;j++){
+                if(arr[j]>arr[j+1]){
+                    int temp=arr[j];
+                    arr[j]=arr[j+1];
+                    arr[j+1]=temp;
+                }
+            }
+            k--;
+            
+        }
+        for(int i=0;i<n;i++)
+            System.out.println(arr[i]);
+        
+    }
+}
diff --git a/Sorting Algorithm in java/InsertionSort.java b/Sorting Algorithm in java/InsertionSort.java
@@ -0,0 +1,14 @@
+public class InsertionSort {
+    public static void main(String[] args) {
+        int a[]={3,5,2,4,1};
+        for(int i=1;i<a.length;i++){
+            int temp=a[i];
+            int j=i-1;
+            while(j>=0 && temp<a[j]){
+                a[j+1]=a[j];
+                j--;
+            }
+            a[j+1]=temp;
+        }
+    }
+}
diff --git a/Sorting Algorithm in java/SelectionSort.java b/Sorting Algorithm in java/SelectionSort.java
@@ -0,0 +1,16 @@
+public class SelectionSort {
+    public static void main(String args[]) {
+      int a[]={3,5,2,4,1};
+      for(int i=0;i<a.length-1;i++){
+          for(int j=i+1;j<a.length;j++){
+              if(a[i]>a[j]){
+                  int temp=a[i];
+                  a[i]=a[j];
+                  a[j]=temp;
+              }
+          }
+      }
+      for(int i=0;i<a.length;i++)
+        System.out.println(a[i]);
+    }
+}
diff --git a/TrainingProblems/ChocolateVanilla.java b/TrainingProblems/ChocolateVanilla.java
@@ -0,0 +1,14 @@
+import java.util.Scanner;
+
+public class ChocolateVanilla {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        long n=sc.nextLong(),k=sc.nextLong();
+        Long c= n%2==0 ? (n/2) : (n/2)+1;
+        if(k<=c)
+            System.out.println((k*2)-1);
+        else
+            System.out.println((k-c)*2);
+        sc.close();
+    }
+}
diff --git a/TrainingProblems/GroupOfPrimeNumber.java b/TrainingProblems/GroupOfPrimeNumber.java
@@ -0,0 +1,29 @@
+public class GroupOfPrimeNumber {
+    public static boolean isprime(long r){
+        if(r!=2 && r%2==0) return false;
+        for(int i=2;i<Math.sqrt(r);i++){
+            if(r%i==0)
+                return false;
+        }
+        return true;
+    }
+    public static void main(String args[]) {
+      long a=1513101918;
+      int n=2;
+    //   int d=(int)Math.pow(10,n);
+    //   while(a>0){
+    //       long r=a%d;
+    //       if(isprime(r))
+    //         System.out.println(r);
+    //       a/=d;
+    //   }
+    String s=String.valueOf(a);
+    int i=0;
+        while(i!=s.length()){
+            int r=Integer.parseInt(s.substring(i,i+n));
+            if(isprime(r))
+                System.out.println(r);
+            i+=n;
+        }
+    }
+}
diff --git a/TrainingProblems/LinkedList.java b/TrainingProblems/LinkedList.java
@@ -0,0 +1,65 @@
+import java.util.Scanner;
+
+class Node{
+    public int val;
+    public Node next;
+}
+public class LinkedList {
+    static Scanner sc=new Scanner(System.in);
+    static Node head;
+    
+    
+    void createNode(){
+        System.out.println("Enter the insert value :");
+        int val=sc.nextInt();
+        Node obj1=new Node();
+        obj1.val=val;
+        obj1.next=null;
+        
+        
+        if(head==null){
+            System.out.println("head is null");
+            head=obj1;
+        }
+        else{
+            Node p=head;
+            while(p.next!=null){
+                System.out.println(p.val);
+                p=p.next;
+            }
+            p.next=obj1;
+        }
+    }
+    
+    void display(){
+        System.out.println("Display the node list :");
+        Node p=head;
+        while(p!=null){
+            System.out.println(p.val);
+            p=p.next;
+        }
+        
+    }
+    public static void main(String[] args) {
+        
+        LinkedList ob=new LinkedList();
+        int n;
+        do{
+            System.out.println("Enter the operation :");
+             n=sc.nextInt();
+            switch(n){
+                case 1:
+                    ob.createNode();
+                    break;
+                case 2:
+                    ob.display();
+                    break;
+                default:
+                    System.out.println("Wrong operation");
+            }
+        
+        }while(n<=2);
+        
+        
+    }
+}
diff --git a/TrainingProblems/checkingMainMethod.java b/TrainingProblems/checkingMainMethod.java
@@ -0,0 +1,5 @@
+public class checkingMainMethod {
+    public static void main(String args[]) {
+        System.out.println(args);
+    }
+}
diff --git a/TrainingProblems/oops.java b/TrainingProblems/oops.java
@@ -0,0 +1,30 @@
+import java.util.*;
+interface area{
+   public  void rect();
+    public void circle();
+}
+
+public class oops implements area
+{
+    int a=10;
+    int b=20;
+    int r=2;
+    public void rect(){
+        System.out.println("Area of rectangle is 10*20: "+(a*b));
+    }
+    public void circle(){
+        System.out.println("Area of circle is 2*2*3.14: "+(r*r*3.14));
+    }
+    
+    public static void main(String args[])
+    {
+        Scanner sc=new Scanner(System.in);
+        int s=sc.nextInt();
+        System.out.println(s);
+        oops obj=new oops();
+        obj.rect();
+        obj.circle();
+        System.out.println("Hello World");
+        sc.close();
+    }
+}
diff --git a/TrainingProblems/primeNumber.java b/TrainingProblems/primeNumber.java
@@ -0,0 +1,34 @@
+import java.util.Scanner;
+
+public class primeNumber {
+
+    public static boolean isprime(int n){
+        // if(n==0 || n==1)
+        //     return false;
+        // if(n==2)
+        //     return true;
+        // for(int i=2;i<n/2;i++){
+        //     if(n%i==0)
+        //         return false;
+        // }
+        // return true;
+        
+        if(n!=2 && n%2==0)
+            return false;
+        for(int i=2;i<=Math.sqrt(n);i++){      // algorithm
+            if(n%i==0)
+                return false;
+        }
+        
+        return true;  
+    }
+    public static void main(String[] args) {
+        Scanner sc=new Scanner(System.in);
+        int n=sc.nextInt();
+        if(isprime(n))
+            System.out.println("Prime number");
+        else 
+            System.out.println("not a prime number");
+        sc.close();
+    }
+}
