implemented quicksort

Author: japko-7

searching_methods/src/algorithms/quick.java

@@ -0,0 +1,44 @@
+package algorithms;
+
+import java.util.ArrayList;
+
+public class quick extends sorting_algorithm
+{
+    public quick()
+    {
+        super();
+    }
+
+    public quick(ArrayList<Integer> source)
+    {
+        super(source);
+    }
+
+    @Override
+    public ArrayList<Integer> sort_out()
+    {
+        sorting_procedure(0, to_be_sorted.size() - 1);
+
+        return to_be_sorted;
+    }
+
+    void sorting_procedure(int low, int high)
+    {
+        int pivot = to_be_sorted.get((low + high) / 2);
+        int i = low, j = high;
+
+        do{
+            while (to_be_sorted.get(i) < pivot) i++;
+            while (to_be_sorted.get(j) > pivot) j--;
+            if (i <= j)
+            {
+                swap(i, j);
+                i++;
+                j--;
+            }
+        } while (i <= j);
+
+        if (j > low) sorting_procedure(low, j);
+        if (i < high) sorting_procedure(i, high);
+    }
+}

searching_methods/src/algorithms/sorting_algorithm.java

@@ -6,12 +6,12 @@ public abstract class sorting_algorithm
 {
     ArrayList<Integer> to_be_sorted;
 
-    public sorting_algorithm()
+    sorting_algorithm()
     {
         this.to_be_sorted = new ArrayList<>();
     }
 
-    public sorting_algorithm(ArrayList<Integer> to_be_sorted)
+    sorting_algorithm(ArrayList<Integer> to_be_sorted)
     {
         this.to_be_sorted = new ArrayList<>(to_be_sorted.size());
         this.to_be_sorted.addAll(to_be_sorted);

searching_methods/src/testing/main.java

@@ -7,7 +7,7 @@
 
 public class main
 {
-    public static Random seed = new Random();
+    static Random seed = new Random();
     static ArrayList<Integer> randomize_new_array(int size)
     {
         ArrayList<Integer> new_array = new ArrayList<Integer>(size);
@@ -17,9 +17,8 @@ static ArrayList<Integer> randomize_new_array(int size)
 
     static void print_array_out(ArrayList<Integer> array)
     {
-        int size = array.size();
-        for (int i = 0; i < size; i++)
-            System.out.println(array.get(i));
+        for (Integer integer : array)
+            System.out.println(integer);
 
         System.out.println("🧶-----------------------🐈");
     }
@@ -46,8 +45,11 @@ public static void main(String args[])
 
         bubble bubble_sort = new bubble();
         insert insert_sort = new insert();
+        quick quick_sort = new quick();
 
         System.out.println(estimate_sorting_duration(bubble_sort, tests));
         System.out.println(estimate_sorting_duration(insert_sort, tests));
+        System.out.println(estimate_sorting_duration(quick_sort, tests));
+//        System.out.println(estimate_sorting_duration(quick_sort, tests));
     }
 }