assignment -2

vivekanand-vr · vivekanand-vr · commit 240069fd3ccd · 2024-03-15T18:45:33.000+05:30
diff --git a/Assignments/Assignment-2/BubbleSort.java b/Assignments/Assignment-2/BubbleSort.java
@@ -0,0 +1,26 @@
+package getitdone.com;
+
+public class BubbleSort {
+	static void swap(int arr[],int i,int j) {
+		int temp=arr[i];
+		arr[i]=arr[j];
+		arr[j]=temp;
+		
+	}
+
+	public static void main(String[] args) {
+		int[] arr= {4,2,5,2,1};
+		for(int i=0;i<arr.length;i++) {
+			for(int j=1;j<arr.length-i;j++) {
+				if(arr[j]<arr[j-1]) {
+					swap(arr,j,j-1);
+				}
+			}
+		}
+	  for(int i=0;i<arr.length;i++) {
+		  System.out.print(arr[i]+" ");
+	  }
+
+	}
+
+}
diff --git a/Assignments/Assignment-2/CheckIfAnArrayIsSubsetOfAnotherArray.java b/Assignments/Assignment-2/CheckIfAnArrayIsSubsetOfAnotherArray.java
@@ -0,0 +1,48 @@
+package getitdone.com;
+
+import java.util.Arrays;
+
+public class CheckIfAnArrayIsSubsetOfAnotherArray {
+	static boolean isSubset(int arr1[],int arr2[],int m,int n) {
+       int i=0;
+       int j=0;
+        if (m < n)
+            return false;
+ 
+        Arrays.sort(arr1); // sorts arr1
+        Arrays.sort(arr2); // sorts arr2
+ 
+        while (i < n && j < m) {
+            if (arr1[j] < arr2[i])
+                j++;
+            else if (arr1[j] == arr2[i]) {
+                j++;
+                i++;
+            }
+            else if (arr1[j] > arr2[i])
+                return false;
+        }
+ 
+        if (i < n)
+            return false;
+        else
+            return true;
+		
+	}
+
+	public static void main(String[] args) {
+		 int arr1[] = { 11, 1, 13, 21, 3, 7 };
+	        int arr2[] = { 11, 7, 1 };
+	 
+	        int m = arr1.length;
+	        int n = arr2.length;
+	 
+	        if (isSubset(arr1, arr2, m, n))
+	            System.out.println("arr2 is a subset of arr1");
+	        else
+	            System.out.println(
+	                "arr2 is not a subset of arr1");
+
+	}
+
+}
diff --git a/Assignments/Assignment-2/FindDuplicate.java b/Assignments/Assignment-2/FindDuplicate.java
@@ -0,0 +1,28 @@
+package getitdone.com;
+
+import java.util.Arrays;
+
+public class FindDuplicate {
+
+	public static void main(String[] args) {
+		int arr[]= {3,1,4,6,7};
+		if(isDuplicatePresent(arr)) {
+			System.out.println("Duplicate elements are present ");
+		}else {
+			System.out.println("No duplicates are present");
+		}
+
+	}
+
+	private static boolean isDuplicatePresent(int[] arr) {
+		Arrays.sort(arr);
+		for(int i=1;i<arr.length;i++) {
+			if(arr[i]==arr[i-1]) {
+				return true;
+			}
+		}
+		
+		return false;
+	}
+
+}
diff --git a/Assignments/Assignment-2/MergeSort.java b/Assignments/Assignment-2/MergeSort.java
@@ -0,0 +1,80 @@
+package getitdone.com;
+
+import java.util.Scanner;
+
+public class MergeSort {
+	static void merge(int[] arr,int l,int mid,int h) {
+		int n1=mid-l+1;
+		int n2=h-mid;
+		int[] left=new int[mid-l+1];
+		int[] right=new int[h-mid];
+		for(int i=0;i<left.length;i++) {
+			left[i]=arr[l+i];
+		}
+		for( int i=0;i<right.length;i++) {
+			right[i]=arr[mid+i+1];
+		}
+		int i=0,j=0,k=l;
+		while(i<n1 && j<n2) {
+			if(left[i]<=right[j]) {
+				arr[k]=left[i];
+				i++;
+				k++;
+			}
+			else {
+				arr[k]=right[j];
+				j++;
+				k++;
+			}
+		}
+		while(i<n1) {
+			arr[k]=left[i];
+			i++;
+			k++;
+			
+		}
+		while(j<n2) {
+			arr[k]=right[j];
+			j++;
+			k++;
+			
+		}
+		
+	}
+	
+	public static void mergeSort(int arr[],int l,int h){
+		
+		
+		if(l<h) {
+			int mid=l+(h-l)/2;
+			mergeSort(arr,l,mid);
+			mergeSort(arr,mid+1,h);
+			merge(arr,l,mid,h);
+		}
+	}
+
+	public static void main(String[] args) {
+		Scanner s =new Scanner(System.in);
+		System.out.println("Enter the size of an array");
+		int n=s.nextInt();
+		int[] arr=new int[n];
+		System.out.println(" Enter the values");
+		for(int i=0;i<n;i++) {
+			arr[i]=s.nextInt();
+		}
+		System.out.println(" This is the given array");
+		for(int i=0;i<n;i++) {
+			System.out.print(arr[i] +" ");
+		}System.out.println();
+		int start=0;
+		int end=arr.length-1;
+		mergeSort(arr,start,end);
+		
+		System.out.println("This is the sorted array");
+		for(int i=0;i<n;i++) {
+			System.out.print(arr[i] +" ");
+		}
+
+	}
+
+}
diff --git a/Assignments/Assignment-2/QuickSort.java b/Assignments/Assignment-2/QuickSort.java
@@ -0,0 +1,63 @@
+package getitdone.com;
+
+import java.util.Scanner;
+
+public class QuickSort {
+	static void swap(int arr[],int i,int j) {
+		int temp=arr[i];
+		arr[i]=arr[j];
+		arr[j]=temp;
+		
+	}
+	static int partition(int[] arr, int lo,int hi) {
+		int i=lo-1;
+		int pivote=arr[hi];
+		for(int j=lo;j<arr.length;j++) {
+			if(arr[j]<pivote) {
+				i++;
+				swap(arr,i,j);
+			}
+		}
+		swap(arr,i+1,hi);
+		
+		
+		
+		return i+1;
+		
+	}
+	
+	private static void quickSort(int arr[],int l,int h) {
+		int n=arr.length;
+		if(l<h) {
+			int p=partition(arr,l,h);
+			quickSort(arr,l,p-1);
+			quickSort(arr,p+1,h);
+		}
+	}
+
+	public static void main(String[] args) {
+		Scanner s =new Scanner(System.in);
+		System.out.println("Enter the size of an array");
+		int n=s.nextInt();
+		int[] arr=new int[n];
+		System.out.println(" Enter the values");
+		for(int i=0;i<n;i++) {
+			arr[i]=s.nextInt();
+		}
+		System.out.println(" This is the given array");
+		for(int i=0;i<n;i++) {
+			System.out.print(arr[i] +" ");
+		}System.out.println();
+		
+		int low=0;
+		int high=n-1;
+		quickSort(arr,low,high);
+		
+		System.out.println("This is the sorted array");
+		for(int i=0;i<n;i++) {
+			System.out.print(arr[i] +" ");
+		}
+		
+	}
+
+}
diff --git a/Assignments/Assignment-2/SelectionSort.java b/Assignments/Assignment-2/SelectionSort.java
@@ -0,0 +1,47 @@
+package getitdone.com;
+
+import java.util.Scanner;
+
+public class SelectionSort {
+	static void swap(int arr[],int i,int j) {
+		int temp=arr[i];
+		arr[i]=arr[j];
+		arr[j]=temp;
+		
+	}
+	static void selectionSort(int[] arr) {
+		for(int i=0;i<arr.length;i++) {
+			int minIndex=i;
+			for(int j=i+1;j<arr.length;j++) {
+				if(arr[j]<arr[minIndex]) {
+					minIndex=j;
+					
+				}
+				
+			}
+			swap(arr,i,minIndex);
+		}
+	}
+
+	public static void main(String[] args) {
+		Scanner s =new Scanner(System.in);
+		System.out.println("Enter the size of an array");
+		int n=s.nextInt();
+		int[] arr=new int[n];
+		System.out.println(" Enter the values");
+		for(int i=0;i<n;i++) {
+			arr[i]=s.nextInt();
+		}
+		System.out.println(" This is the given array");
+		for(int i=0;i<n;i++) {
+			System.out.print(arr[i] +" ");
+		}System.out.println();
+	  selectionSort(arr);
+      
+	  System.out.println("This is the sorted array");
+		for(int i=0;i<n;i++) {
+			System.out.print(arr[i] +" ");
+		}
+	}
+
+}
