Add files via upload

Author: Jakub-Radzik

Lab6/Lab6.iml

@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>

Lab6/Lab6Radzik.zip

@@ -0,0 +1,51 @@
+import java.util.Arrays;
+import java.util.Random;
+
+public class Main {
+    private static final int size = 128;
+    public static void main(String[] args) {
+        Random rand = new Random();
+        int[] arr = new int[size];
+//        int[] arr = {0,1,2,3,4,5,6,7};
+//        int[] arr = {7,6,5,4,3,2,1,0};
+        int[] testArr;
+
+        for (int i = 0; i < size; i++) {
+            int n = rand.nextInt(5000);
+            arr[i] = n;
+        }
+
+        System.out.println("TABLICA TESTOWA:");
+        for (int i = 0; i < arr.length; i++) {
+            System.out.print(arr[i]+", ");
+        }
+
+        System.out.println();
+        System.out.println("TABLICA PO SORTOWANIU");
+
+        testArr = arr.clone();
+        SortMethods.BubbleSort(testArr);
+        System.out.println("BUBBLE SORT: [PORÓWNANIA - PRZEPISANIA] - ["+SortMethods.getComparisions()+"-"+SortMethods.getRewrites()+"]");
+        SortMethods.setComparisions(0);
+        SortMethods.setRewrites(0);
+
+
+        testArr = arr.clone();
+        SortMethods.InsertionSort(testArr);
+        System.out.println("INSERTION SORT: [PORÓWNANIA - PRZEPISANIA] - ["+SortMethods.getComparisions()+"-"+SortMethods.getRewrites()+"]");
+        SortMethods.setComparisions(0);
+        SortMethods.setRewrites(0);
+
+        testArr = arr.clone();
+        SortMethods.SelectionSort(testArr);
+        System.out.println("SELECTION SORT: [PORÓWNANIA - PRZEPISANIA] - ["+SortMethods.getComparisions()+"-"+SortMethods.getRewrites()+"]");
+        SortMethods.setComparisions(0);
+        SortMethods.setRewrites(0);
+
+        SortMethods.SelectionSort(arr);
+        for (int i = 0; i < arr.length; i++) {
+            System.out.print(testArr[i]+", ");
+        }
+
+    }
+}

Lab6/Wyniki Sortowań.docx

@@ -0,0 +1,76 @@
+public class SortMethods {
+
+    private static int comparisions = 0;
+    private static int rewrites = 0;
+
+    public static int getComparisions() {
+        return comparisions;
+    }
+
+    public static int getRewrites() {
+        return rewrites;
+    }
+
+
+    public static void setComparisions(int comparisions) {
+        SortMethods.comparisions = comparisions;
+    }
+
+    public static void setRewrites(int rewrites) {
+        SortMethods.rewrites = rewrites;
+    }
+
+
+    public static void SelectionSort(int[] arr){
+        int n = arr.length;
+        for (int i = 0; i < n-1; i++) {
+            int min_idx = i;
+            for (int j = i + 1; j < n; j++){
+                comparisions++;
+                if (arr[j] < arr[min_idx])
+                    min_idx = j;
+                    rewrites++;
+            }
+            rewrites+=3;
+            int temp = arr[min_idx];
+            arr[min_idx] = arr[i];
+            arr[i] = temp;
+        }
+    }
+
+    public static void InsertionSort(int[] arr){
+        int n = arr.length;
+        for (int i = 1; i < n; ++i) {
+            rewrites++;
+            int key = arr[i];
+            int j = i - 1;
+            while (j >= 0 && arr[j] > key) {
+                rewrites++;
+                comparisions++;
+                arr[j + 1] = arr[j];
+                j = j - 1;
+            }
+
+            if(j>=0){
+                comparisions++;
+            }
+
+            rewrites++;
+            arr[j + 1] = key;
+        }
+    }
+
+    public static void BubbleSort(int[] arr){
+        int n = arr.length;
+        for (int i = 0; i < n-1; i++)
+            for (int j = 0; j < n-i-1; j++){
+                comparisions++;
+                if (arr[j] > arr[j+1]) {
+                    rewrites+=3;
+                    int temp = arr[j];
+                    arr[j] = arr[j+1];
+                    arr[j+1] = temp;
+                }}
+    }
+
+}