add sort method

Author: 15045120

src/main/java/com/github/myibu/algorithm/sort/BubbleSorts.java

@@ -0,0 +1,144 @@
+package com.github.myibu.algorithm.sort;
+import java.util.Comparator;
+
+/**
+ * Bubble Sort
+ * @author myibu
+ * Created on 2021/11/2
+ */
+public class BubbleSorts implements Sorts {
+@Override
+public void sort(byte[] a) {
+int n = a.length;
+for (int i = 0; i < n-1; i++) {
+for (int j = 0; j < n - i - 1; j++) {
+if (a[j] > a[j + 1]) {
+byte temp = a[j];
+a[j] = a[j + 1];
+a[j + 1] = temp;
+}
+}
+}
+}
+
+@Override
+public void sort(short[] a) {
+int n = a.length;
+for (int i = 0; i < n-1; i++) {
+for (int j = 0; j < n - i - 1; j++) {
+if (a[j] > a[j + 1]) {
+// swap arr[j+1] and arr[j]
+short temp = a[j];
+a[j] = a[j + 1];
+a[j + 1] = temp;
+}
+}
+}
+}
+
+@Override
+public void sort(int[] a) {
+int n = a.length;
+for (int i = 0; i < n-1; i++) {
+for (int j = 0; j < n - i - 1; j++) {
+if (a[j] > a[j + 1]) {
+// swap arr[j+1] and arr[j]
+int temp = a[j];
+a[j] = a[j + 1];
+a[j + 1] = temp;
+}
+}
+}
+}
+
+@Override
+public void sort(long[] a) {
+int n = a.length;
+for (int i = 0; i < n-1; i++) {
+for (int j = 0; j < n - i - 1; j++) {
+if (a[j] > a[j + 1]) {
+// swap arr[j+1] and arr[j]
+long temp = a[j];
+a[j] = a[j + 1];
+a[j + 1] = temp;
+}
+}
+}
+}
+
+@Override
+public void sort(float[] a) {
+int n = a.length;
+for (int i = 0; i < n-1; i++) {
+for (int j = 0; j < n - i - 1; j++) {
+if (a[j] > a[j + 1]) {
+// swap arr[j+1] and arr[j]
+float temp = a[j];
+a[j] = a[j + 1];
+a[j + 1] = temp;
+}
+}
+}
+}
+
+@Override
+public void sort(double[] a) {
+int n = a.length;
+for (int i = 0; i < n-1; i++) {
+for (int j = 0; j < n - i - 1; j++) {
+if (a[j] > a[j + 1]) {
+// swap arr[j+1] and arr[j]
+double temp = a[j];
+a[j] = a[j + 1];
+a[j + 1] = temp;
+}
+}
+}
+}
+
+@Override
+public void sort(char[] a) {
+int n = a.length;
+for (int i = 0; i < n-1; i++) {
+for (int j = 0; j < n - i - 1; j++) {
+if (a[j] > a[j + 1]) {
+// swap arr[j+1] and arr[j]
+char temp = a[j];
+a[j] = a[j + 1];
+a[j + 1] = temp;
+}
+}
+}
+}
+
+@Override
+public void sort(Object[] a) {
+int n = a.length;
+for (int i = 0; i < n-1; i++) {
+for (int j = 0; j < n - i - 1; j++) {
+Comparable pre = (Comparable)a[j];
+if (pre.compareTo(a[j+1]) > 0) {
+// swap arr[j+1] and arr[j]
+Object temp = a[j];
+a[j] = a[j + 1];
+a[j + 1] = temp;
+}
+}
+}
+}
+
+@Override
+public <T> void sort(T[] a, Comparator<? super T> c) {
+int n = a.length;
+for (int i = 0; i < n-1; i++) {
+for (int j = 0; j < n - i - 1; j++) {
+if (c.compare(a[j], a[j+1]) > 0) {
+// swap arr[j+1] and arr[j]
+T temp = a[j];
+a[j] = a[j + 1];
+a[j + 1] = temp;
+}
+}
+}
+}
+}

src/main/java/com/github/myibu/algorithm/sort/BucketSorts.java

@@ -0,0 +1,83 @@
+package com.github.myibu.algorithm.sort;
+import java.util.*;
+
+/**
+ * Bucket Sort
+ * @author myibu
+ * Created on 2021/11/2
+ */
+public class BucketSorts implements Sorts {
+@Override
+public void sort(byte[] a) {
+
+}
+
+@Override
+public void sort(short[] a) {
+
+}
+
+@Override
+public void sort(int[] a) {
+int max = Integer.MIN_VALUE;
+int min = Integer.MAX_VALUE;
+for (int i = 0; i < a.length; i++) {
+max = Math.max(max, a[i]);
+min = Math.min(min, a[i]);
+}
+
+int bucketNum = (max - min) / a.length + 1;
+List<List<Integer>> bucketArr = new ArrayList<>(bucketNum);
+for (int i = 0; i < bucketNum; i++) {
+bucketArr.add(new ArrayList<>());
+}
+
+for (int i = 0; i < a.length; i++) {
+int num = (a[i] - min) / (a.length);
+bucketArr.get(num).add(a[i]);
+}
+
+for (int i = 0; i < bucketArr.size(); i++) {
+Integer[] a1 = bucketArr.get(i).toArray(new Integer[0]);
+new QuickSorts().sort(a1);
+bucketArr.set(i, Arrays.asList(a1));
+}
+
+int index = 0;
+for (int i = 0; i < bucketArr.size(); i++) {
+for (int j = 0; j < bucketArr.get(i).size(); j++) {
+a[index++] = bucketArr.get(i).get(j);
+}
+}
+}
+
+@Override
+public void sort(long[] a) {
+
+}
+
+@Override
+public void sort(float[] a) {
+
+}
+
+@Override
+public void sort(double[] a) {
+
+}
+
+@Override
+public void sort(char[] a) {
+
+}
+
+@Override
+public void sort(Object[] a) {
+
+}
+
+@Override
+public <T> void sort(T[] a, Comparator<? super T> c) {
+
+}
+}