Restructured the repo

scnucxy · Nov 13, 2018 · 819b7fd · 819b7fd
1 parent fdc887e
commit 819b7fd
Show file tree

Hide file tree

Showing 30 changed files with 59 additions and 222 deletions.
diff --git a/.classpath b/.classpath
diff --git a/.gitignore b/.gitignore
@@ -1 +1,5 @@
 /bin/
+.idea/*
+.classpath*
+.project*
+*.iml
diff --git a/.project b/.project
diff --git a/Searches/src/search/BinarySearch.java → Searches/BinarySearch.java b/Searches/src/search/BinarySearch.java → Searches/BinarySearch.java
@@ -1,4 +1,4 @@
-package search;
+package Searches;
 
 import java.util.Arrays;
 import java.util.Random;

diff --git a/Searches/src/search/InterpolationSearch.java → Searches/InterpolationSearch.java b/Searches/src/search/InterpolationSearch.java → Searches/InterpolationSearch.java
@@ -1,4 +1,4 @@
-package search;
+package Searches;
 
 import java.util.Arrays;
 import java.util.Random;

diff --git a/...hes/src/search/IterativeBinarySearch.java → Searches/IterativeBinarySearch.java b/...hes/src/search/IterativeBinarySearch.java → Searches/IterativeBinarySearch.java
@@ -1,4 +1,4 @@
-package search;
+package Searches;
 
 import java.util.Arrays;
 import java.util.Random;

diff --git a/...es/src/search/IterativeTernarySearch.java → Searches/IterativeTernarySearch.java b/...es/src/search/IterativeTernarySearch.java → Searches/IterativeTernarySearch.java
@@ -1,4 +1,4 @@
-package search;
+package Searches;
 
 import java.util.Arrays;
 import java.util.Random;

diff --git a/Searches/src/search/LinearSearch.java → Searches/LinearSearch.java b/Searches/src/search/LinearSearch.java → Searches/LinearSearch.java
@@ -1,4 +1,4 @@
-package search;
+package Searches;
 
 import java.util.Random;
 import java.util.stream.Stream;

diff --git a/Searches/src/search/SaddlebackSearch.java → Searches/SaddlebackSearch.java b/Searches/src/search/SaddlebackSearch.java → Searches/SaddlebackSearch.java
@@ -1,4 +1,4 @@
-package search;
+package Searches;
 
 import java.util.Scanner;
 

diff --git a/Searches/src/search/SearchAlgorithm.java → Searches/SearchAlgorithm.java b/Searches/src/search/SearchAlgorithm.java → Searches/SearchAlgorithm.java
@@ -1,4 +1,4 @@
-package search;
+package Searches;
 
 /**
  *  The common interface of most searching algorithms

diff --git a/Searches/src/search/TernarySearch.java → Searches/TernarySearch.java b/Searches/src/search/TernarySearch.java → Searches/TernarySearch.java
@@ -1,4 +1,4 @@
-package search;
+package Searches;
 
 
 import java.util.Arrays;

diff --git a/SkylineProblem/SkylineProblem.java b/SkylineProblem/SkylineProblem.java
diff --git a/Sorts/src/sort/BinaryTreeSort.java → Sorts/BinaryTreeSort.java b/Sorts/src/sort/BinaryTreeSort.java → Sorts/BinaryTreeSort.java
@@ -1,7 +1,7 @@
-package sort;
+package Sorts;
 
-import static sort.SortUtils.less;
-import static sort.SortUtils.print;
+import static Sorts.SortUtils.less;
+import static Sorts.SortUtils.print;
 
 /**
  *

diff --git a/Sorts/src/sort/BogoSort.java → Sorts/BogoSort.java b/Sorts/src/sort/BogoSort.java → Sorts/BogoSort.java
@@ -1,9 +1,7 @@
-package sort;
+package Sorts;
 
 import java.util.Random;
 
-import static sort.SortUtils.*;
-
 
 /**
  *
@@ -19,7 +17,7 @@ public class BogoSort implements SortAlgorithm {
 
     private static <T extends Comparable<T>> boolean isSorted(T array[]){
         for(int i = 0; i<array.length - 1; i++){
-            if(less(array[i + 1], array[i])) return false;
+            if(SortUtils.less(array[i + 1], array[i])) return false;
         }
         return true;
     }
@@ -30,7 +28,7 @@ private static <T> void nextPermutation(T array[]){
 
         for (int i = 0; i < array.length; i++) {
             int randomIndex = i + random.nextInt(length - i);
-            swap(array, randomIndex, i);
+            SortUtils.swap(array, randomIndex, i);
         }
     }
 
@@ -49,11 +47,11 @@ public static void main(String[] args) {
         BogoSort bogoSort = new BogoSort();
 
         // print a sorted array
-        print(bogoSort.sort(integers));
+        SortUtils.print(bogoSort.sort(integers));
 
         // String Input
         String[] strings = {"c", "a", "e", "b","d"};
 
-        print(bogoSort.sort(strings));
+        SortUtils.print(bogoSort.sort(strings));
     }
 }
diff --git a/Sorts/src/sort/BubbleSort.java → Sorts/BubbleSort.java b/Sorts/src/sort/BubbleSort.java → Sorts/BubbleSort.java
@@ -1,6 +1,6 @@
-package sort;
+package Sorts;
 
-import static sort.SortUtils.*;
+import static Sorts.SortUtils.*;
 
 /**
  *

diff --git a/Sorts/src/sort/CocktailShakerSort.java → Sorts/CocktailShakerSort.java b/Sorts/src/sort/CocktailShakerSort.java → Sorts/CocktailShakerSort.java
@@ -1,6 +1,4 @@
-package sort;
-
-import static sort.SortUtils.*;
+package Sorts;
 
 /**
  *
@@ -29,17 +27,17 @@ public <T extends Comparable<T>> T[] sort(T[] array) {
             // front
             swappedRight = 0;
             for (int i = left; i < right; i++) {
-                if (less(array[i + 1], array[i])) {
-                    swap(array, i, i + 1);
+                if (SortUtils.less(array[i + 1], array[i])) {
+                    SortUtils.swap(array, i, i + 1);
                     swappedRight = i;
                 }
             }
             // back
             right = swappedRight;
             swappedLeft = length - 1;
             for (int j = right; j > left; j--) {
-                if (less(array[j], array[j - 1])) {
-                    swap(array, j - 1, j);
+                if (SortUtils.less(array[j], array[j - 1])) {
+                    SortUtils.swap(array, j - 1, j);
                     swappedLeft = j;
                 }
             }
@@ -56,11 +54,11 @@ public static void main(String[] args) {
 		CocktailShakerSort shakerSort = new CocktailShakerSort();
 
 		// Output => 1 4 6 9 12 23 54 78 231
-		print(shakerSort.sort(integers));
+		SortUtils.print(shakerSort.sort(integers));
 
 		// String Input
 		String[] strings = { "c", "a", "e", "b", "d" };
-		print(shakerSort.sort(strings));
+		SortUtils.print(shakerSort.sort(strings));
 	}
 
 

diff --git a/Sorts/src/sort/CombSort.java → Sorts/CombSort.java b/Sorts/src/sort/CombSort.java → Sorts/CombSort.java
@@ -1,6 +1,6 @@
-package sort;
+package Sorts;
 
-import static sort.SortUtils.*;
+import static Sorts.SortUtils.*;
 
 
 /**

diff --git a/Sorts/src/sort/CountingSort.java → Sorts/CountingSort.java b/Sorts/src/sort/CountingSort.java → Sorts/CountingSort.java
@@ -1,12 +1,12 @@
-package sort;
+package Sorts;
 
 import java.util.*;
 import java.util.stream.IntStream;
 import java.util.stream.Stream;
 
 import static java.util.stream.Collectors.toList;
 import static java.util.stream.Collectors.toMap;
-import static sort.SortUtils.print;
+import static Sorts.SortUtils.print;
 
 /**
  *

diff --git a/Sorts/src/sort/CycleSort.java → Sorts/CycleSort.java b/Sorts/src/sort/CycleSort.java → Sorts/CycleSort.java
@@ -1,7 +1,7 @@
-package sort;
+package Sorts;
 
-import static sort.SortUtils.less;
-import static sort.SortUtils.print;
+import static Sorts.SortUtils.less;
+import static Sorts.SortUtils.print;
 
 /**
  *  @author Podshivalov Nikita (https://github.com/nikitap492)

diff --git a/Sorts/src/sort/GnomeSort.java → Sorts/GnomeSort.java b/Sorts/src/sort/GnomeSort.java → Sorts/GnomeSort.java
@@ -1,6 +1,6 @@
-package sort;
+package Sorts;
 
-import static sort.SortUtils.*;
+import static Sorts.SortUtils.*;
 
 /**
  * Implementation of gnome sort

diff --git a/Sorts/src/sort/HeapSort.java → Sorts/HeapSort.java b/Sorts/src/sort/HeapSort.java → Sorts/HeapSort.java
@@ -1,10 +1,10 @@
-package sort;
+package Sorts;
 
 import java.util.ArrayList;
 import java.util.Arrays;
 import java.util.List;
 
-import static sort.SortUtils.*;
+import static Sorts.SortUtils.*;
 
 /**
  * Heap Sort Algorithm

diff --git a/Sorts/src/sort/InsertionSort.java → Sorts/InsertionSort.java b/Sorts/src/sort/InsertionSort.java → Sorts/InsertionSort.java
@@ -1,7 +1,7 @@
-package sort;
+package Sorts;
 
-import static sort.SortUtils.less;
-import static sort.SortUtils.print;
+import static Sorts.SortUtils.less;
+import static Sorts.SortUtils.print;
 
 /**
  *