this is repo to be commited

Author: amangit1314

arrays/Maximum_subarray_problem.java

@@ -0,0 +1,44 @@
+package arrays;
+
+public class Maximum_subarray_problem {
+	// Java program to print largest  
+	// contiguous array sum 
+	  
+	    static void maxSubArraySum(int a[], int size) 
+	    { 
+	        int max_so_far = Integer.MIN_VALUE, 
+	        max_ending_here = 0,start = 0, 
+	        end = 0, s = 0; 
+	  
+	        for (int i = 0; i < size; i++)  
+	        { 
+	            max_ending_here += a[i]; 
+	  
+	            if (max_so_far < max_ending_here)  
+	            { 
+	                max_so_far = max_ending_here; 
+	                start = s; 
+	                end = i; 
+	            } 
+	  
+	            if (max_ending_here < 0)  
+	            { 
+	                max_ending_here = 0; 
+	                s = i + 1; 
+	            } 
+	        } 
+	        System.out.println("Maximum contiguous sum is " 
+	                           + max_so_far); 
+	        System.out.println("Starting index " + start); 
+	        System.out.println("Ending index " + end); 
+	    } 
+	  
+	    // Driver code 
+	    public static void main(String[] args) 
+	    { 
+	        int a[] = { -2, -3, 4, -1, -2, 1, 5, -3 }; 
+	        int n = a.length; 
+	        maxSubArraySum(a, n); 
+	    } 
+	} 
+

arrays/RotateArray.java

@@ -0,0 +1,38 @@
+package arrays;
+
+public class RotateArray {
+	
+		//function to rotate the elements of an array
+	
+		void rotateL(int a[], int d, int n) {
+			for(int i= 0;i<d;i++) 
+				rotateLByOne(a,n);
+		}
+		
+		// rotate the array by left by one
+		
+		void rotateLByOne(int a[],int n) {
+			int i,temp;
+			temp = a[0];
+			for(i =0;i<n-1;i++)
+				a[i] = a[i+1];
+			a[i] = temp;
+		} 
+		
+		// a utility function to display the elements  of array
+		
+		void printArray(int a[],int n) {
+			for(int i=0;i<n;i++) 
+				System.out.print(a[i]+" ");	
+		}
+		
+		// driver method of the program
+		public static void main(String[] args) {
+			
+			RotateArray rotate = new RotateArray();
+			
+			int a[] = {2,4,6,8,10,12,14,16,18,20};
+			rotate.rotateL(a, 3, 10);
+			rotate.printArray(a , 10);
+		}
+}

arrays/Sort_an_array_of_0s_1s_2s_without_using_extra_space_or_sorting_algo.java

@@ -0,0 +1,38 @@
+package arrays;
+import java.util.Arrays; 
+
+public class Sort_an_array_of_0s_1s_2s_without_using_extra_space_or_sorting_algo {
+	    static int arr1[] = new int[]{1, 5, 9, 10, 15, 20}; 
+	    static int arr2[] = new int[]{2, 3, 8, 13}; 
+	      
+	    static void merge(int m, int n) 
+	    { 
+	        // Iterate through all elements of ar2[] starting from to the last element 
+	        for (int i=n-1; i>=0; i--) 
+	        { 
+	        /* Find the smallest element greater than ar2[i]. Move all elements one position ahead till the smallest greater 
+	           element is not found */
+	            int j, last = arr1[m-1]; 
+	            
+	            for (j=m-2; j >= 0 && arr1[j] > arr2[i]; j--) 
+	                arr1[j+1] = arr1[j]; 
+	       
+	            // If there was a greater element 
+	            if (j != m-2 || last > arr2[i]) { 
+	                arr1[j+1] = arr2[i]; 
+	                arr2[i] = last; 
+	            
+	            } 
+	        } 
+	    } 
+	      
+	    // Driver method to test the above function 
+	    public static void main1(String[] args) 
+	    { 
+	        merge(arr1.length,arr2.length); 
+	        System.out.print("After Merging nFirst Array: "); 
+	        System.out.println(Arrays.toString(arr1)); 
+	        System.out.print("Second Array:  "); 
+	        System.out.println(Arrays.toString(arr2)); 
+	    }
+}

basicProblems/Factorial.java

@@ -0,0 +1,19 @@
+package basicProblems;
+import java.util.*;
+public class Factorial {
+	
+	public static void main(String[] args) {
+		int fact=1;
+			@SuppressWarnings("resource")
+			Scanner sc = new Scanner(System.in);
+		int n = sc.nextInt();
+		
+		for(int i = n ; i>=1;i--) {
+			fact = fact*i;
+		}
+		
+		System.out.println("fact of " + n + " is " + fact );
+	}
+}
+
+

basicProblems/Fibonacci_Series.java

@@ -0,0 +1,24 @@
+package basicProblems;
+import java.util.*;
+public class Fibonacci_Series {
+
+	public static void main(String[] args) {
+		
+		@SuppressWarnings("resource")
+		Scanner sc = new Scanner(System.in);
+		int n = sc.nextInt();
+		int a=0,b=1;
+		
+		System.out.println(a + " ");
+		System.out.println(b + " ");
+		
+		for(int i=0;i<n-2;i++) {
+			int c = a+b;
+			System.out.println(c + " ");
+			a=b;
+			b=c;
+		}
+		
+	}
+
+}

basicProblems/Multiplicative_Table_till_20.java

@@ -0,0 +1,20 @@
+package basicProblems;
+
+public class Multiplicative_Table_till_20 {
+
+	public static void main(String[] args) {
+		
+		for(int i=1;i<=20;i++) {
+			
+			int tableOf = i;
+			
+			for(int j =1;j<=10;j++) {
+				System.out.print(tableOf*i + " ");
+			}
+			
+			System.out.println();
+		}
+
+	}
+
+}

basicProblems/Palindrome_Number.java

@@ -0,0 +1,13 @@
+package basicProblems;
+
+public class Palindrome_Number {
+
+	public static void main(String[] args) {
+		
+		
+		
+		
+
+	}
+
+}

basicProblems/Prime_Number_Or_Not.java

@@ -0,0 +1,21 @@
+package basicProblems;
+import java.util.*;
+public class Prime_Number_Or_Not {
+
+	public static void main(String[] args) {
+		@SuppressWarnings("resource")
+		Scanner sc = new Scanner(System.in);
+		int n = sc.nextInt();
+		boolean isPrime = true;
+		for(int i=2;i<n;i++) {
+			if(n % i == 0) {
+				isPrime = false;
+				break;
+			}
+		}
+		System.out.print(" is Prime " + isPrime);
+		
+
+	}
+
+}

basicProblems/Series_Sum_1.java

@@ -0,0 +1,20 @@
+package basicProblems;
+import java.util.*;
+public class Series_Sum_1 {
+
+	public static void main(String[] args) {
+		
+		@SuppressWarnings("resource")
+		Scanner sc = new Scanner(System.in);
+		int n = sc.nextInt();
+		
+		float result = 0;
+		
+		for(float i=1;i<=n;i++) {
+			result +=1/i;
+		}
+		System.out.println(result);
+
+	}
+
+}

basicProblems/Series_Sum_2.java

@@ -0,0 +1,32 @@
+package basicProblems;
+import java.util.Scanner;
+
+/* This series is also known as TAYLOR series*/
+// program to demonstrate series sum of "1 + 1/2 + 1/3 + 1/4 + 1/5 + ...1 /n" this before mentioned series
+
+public class Series_Sum_2 {
+
+	public static void main(String[] args) {
+		
+		@SuppressWarnings("resource")
+		Scanner sc = new Scanner(System.in);
+		int n = sc.nextInt();
+		
+		float result = 0;
+		
+		for(float i=1;i<=n;i++) {
+			
+			if(i%2==0) {
+				result -= 1/i;
+			}
+			
+			else {
+				result += 1/i;
+			}
+			
+			System.out.println(result);
+		}
+		
+	}
+
+}