Made files for college questions for DAA

Author: OmkarS25

College/DAA/Practical_1.java

@@ -0,0 +1,79 @@
+// Bubble Sort, Selection Sort, Insertion Sort
+
+import java.util.Random; 
+
+public class Practical_1 { 
+    private static void bubblesort(int size){
+        long start, end; double c;
+        Random random = new Random(); 
+        int[] a = new int[size];
+        for (int i = 0; i < size; i++) {
+            a[i] = random.nextInt(1000);
+        }
+        start = System.nanoTime();
+        for (int i = 0; i < size - 1; i++) {
+            for (int j = 0; j < size - i - 1; j++) { 
+                if (a[j + 1] < a[j]) {
+                    int t = a[j]; 
+                    a[j] = a[j + 1]; 
+                    a[j + 1] = t;
+                }
+            }
+        }
+        end = System.nanoTime(); c = (double) (end - start);
+        System.out.println("\nBUBBLE SORT"); 
+        System.out.println("Time:" + c);
+    }
+
+    private static void selectionsort(int size){
+        long start, end; double c;
+        Random random = new Random(); 
+        int[] a = new int[size];
+        for (int i = 0; i < size; i++) {
+            a[i] = random.nextInt(1000);
+        }
+        start = System.nanoTime();
+        for (int i = 0; i < size - 1; i++) {
+            int min = i;
+            for (int j = i + 1; j < size; j++) {
+                if (a[j] < a[min]) {
+                    min = j;
+                }
+            }
+            int t = a[min]; 
+            a[min] = a[i]; 
+            a[i] = t;
+        }
+        end = System.nanoTime(); c = (double) (end - start);
+        System.out.println("\nSELECTION SORT"); 
+        System.out.println("Time:" + c);
+    }
+
+    private static void insertionsort(int size){
+        long start, end; double c;
+        Random random = new Random(); 
+        int[] a = new int[size];
+        for (int i = 0; i < size; i++) {
+            a[i] = random.nextInt(1000);
+        }
+        start = System.nanoTime();
+        for (int i = 1; i < size; i++) {
+            int t = a[i];
+            int j = i - 1;
+            while (j >= 0 && a[j] > t) {
+                a[j + 1] = a[j];
+                j = j - 1;
+            }
+            a[j + 1] = t;
+        }
+        end = System.nanoTime(); c = (double) (end - start);
+        System.out.println("\nINSERTION SORT"); 
+        System.out.println("Time:" + c);
+    }
+    public static void main(String[] args) { 
+        int size = 1000;
+        bubblesort(size);
+        selectionsort(size);
+        insertionsort(size);
+    }
+}

College/DAA/Practical_10.java

@@ -0,0 +1,7 @@
+import java.util.*;
+
+public class Practical_10 {
+    public static void main(String [] args){
+        
+    }
+}

College/DAA/Practical_11.java

@@ -0,0 +1,7 @@
+import java.util.*;
+
+public class Practical_11 {
+    public static void main(String [] args){
+        
+    }
+}

College/DAA/Practical_12.java

@@ -0,0 +1,7 @@
+import java.util.*;
+
+public class Practical_12 {
+    public static void main(String [] args){
+        
+    }
+}

College/DAA/Practical_13.java

@@ -0,0 +1,7 @@
+import java.util.*;
+
+public class Practical_13 {
+    public static void main(String [] args){
+        
+    }
+}

College/DAA/Practical_14.java

@@ -0,0 +1,7 @@
+import java.util.*;
+
+public class Practical_14 {
+    public static void main(String [] args){
+        
+    }
+}

College/DAA/Practical_15.java

@@ -0,0 +1,7 @@
+import java.util.*;
+
+public class Practical_15 {
+    public static void main(String [] args){
+        
+    }
+}

College/DAA/Practical_2.java

@@ -0,0 +1,9 @@
+// Merge Sort, Quick Sort, Heap Sort
+
+import java.util.*;
+
+public class Practical_2 {
+    public static void main(String [] args){
+        
+    }
+}

College/DAA/Practical_3.java

@@ -0,0 +1,7 @@
+import java.util.*;
+
+public class Practical_3 {
+    public static void main(String [] args){
+        
+    }
+}

College/DAA/Practical_4.java

@@ -0,0 +1,7 @@
+import java.util.*;
+
+public class Practical_4 {
+    public static void main(String [] args){
+        
+    }
+}

College/DAA/Practical_5.java

@@ -0,0 +1,7 @@
+import java.util.*;
+
+public class Practical_5 {
+    public static void main(String [] args){
+        
+    }
+}

College/DAA/Practical_6.java

@@ -0,0 +1,7 @@
+import java.util.*;
+
+public class Practical_6 {
+    public static void main(String [] args){
+        
+    }
+}

College/DAA/Practical_7.java

@@ -0,0 +1,7 @@
+import java.util.*;
+
+public class Practical_7 {
+    public static void main(String [] args){
+        
+    }
+}

College/DAA/Practical_8.java

@@ -0,0 +1,7 @@
+import java.util.*;
+
+public class Practical_8 {
+    public static void main(String [] args){
+        
+    }
+}

College/DAA/Practical_9.java

@@ -0,0 +1,7 @@
+import java.util.*;
+
+public class Practical_9 {
+    public static void main(String [] args){
+        
+    }
+}

College/Merge_sort.cpp

@@ -0,0 +1,81 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+void merge(vector<int>& arr, vector<int> & temp, int start, int end){
+    int mid = (start + end)/2;
+    int idx_tmp = start;
+    int i = start, j = mid+1;
+    while(i <= mid && j <= end){
+        if(arr[i] < arr[j]){
+            temp[idx_tmp++] = arr[i++];
+        }
+        else{
+            temp[idx_tmp++] = arr[j++];
+        }
+    }
+    while(i<=mid)
+        temp[idx_tmp++] = arr[i++];
+    while(j<=end)
+        temp[idx_tmp++] = arr[j++];
+    while(start<=end){
+        arr[start] = temp[start];
+        start++;
+    }
+}
+
+void merge_sort(vector<int>& arr, vector<int>& temp, int start, int end){
+    if(start >= end) return;
+    int mid = (start + end)/2;
+    merge_sort(arr, temp, start, mid);
+    merge_sort(arr, temp, mid+1, end);
+    merge(arr, temp, start, end);
+}
+
+void sort_array(vector<int>& arr){
+    int n = arr.size();
+    vector<int> temp(n,0);
+    merge_sort(arr, temp, 0, n-1);
+}
+
+void bubbleSort(vector<int>& arr){
+    int n = arr.size();
+    for(int i = 0; i < n-1; i++){
+        for(int j = 0; j < n-i-1; j++){
+            if(arr[j] > arr[j+1]){
+                swap(arr[j], arr[j+1]);
+            }
+        }
+    }
+}
+
+int main(){
+    vector<int> a,b;
+    int items = 1000; 
+    for (int i = 0; i < items; i++) {
+        int num = rand();
+        a.push_back(num);
+        b.push_back(num);
+    }
+    cout << "\n" << "No. of items: " << items << "\n";
+
+    // Merge Sort
+    {
+        chrono::high_resolution_clock::time_point start_time_merge = chrono::high_resolution_clock::now();
+        sort_array(a);
+        chrono::high_resolution_clock::time_point end_time_merge = chrono::high_resolution_clock::now();
+        chrono::duration<double, nano> runtime_merge = end_time_merge - start_time_merge;
+        cout<<"Merge Sort: ";
+        cout << "\n" << "Runtime: " << runtime_merge.count() << " nanoseconds\n";
+    }
+
+    // Bubble Sort
+    {
+        chrono::high_resolution_clock::time_point start_time_bubble = chrono::high_resolution_clock::now();
+        bubbleSort(b);
+        chrono::high_resolution_clock::time_point end_time_bubble = chrono::high_resolution_clock::now();
+        chrono::duration<double, nano> runtime = end_time_bubble - start_time_bubble;
+        cout<<"Bubble Sort: ";
+        cout << "\n" << "Runtime: " << runtime.count() << " nanoseconds";
+    }
+    return 0;
+}