Correção dos problemas informados pela plataforma Codacy

.github/workflows/ci.yml

@@ -1,6 +1,5 @@
 name: Java CI
 
-
 on: [push, pull_request]
 
 jobs:
@@ -18,4 +17,4 @@ jobs:
       - run: java src/algoritmos/RadixSort.java
       - run: java src/algoritmos/BubbleSort.java
       - run: java src/algoritmos/MergeSort.java
-      - run: java src/algoritmos/SelectionSort.java
+      - run: java src/algoritmos/SelectionSort.java

src/algoritmos/Bubblesort.java

@@ -0,0 +1,45 @@
+package algoritmos;
+
+import java.io.IOException;
+
+public class Bubblesort {
+
+	public static void main(String[] args) throws IOException {
+
+             int quantidade = 10000;
+             int[] vetor = new int[quantidade];
+
+            System.out.println("\nVetor: ");
+             for (int i = 0; i < vetor.length; i++) {
+                     vetor[i] = (int) (Math.random()*quantidade);
+
+                     System.out.print(vetor[i] + " ");
+             }
+
+             long tempoInicial = System.currentTimeMillis();
+
+             bubbleSort(vetor);
+
+             long tempoFinal = System.currentTimeMillis();
+
+             System.out.println("\nExecutado em = " + (tempoFinal - tempoInicial) + " ms");
+
+
+       }
+
+       private static void bubbleSort(int vetor[]){
+               boolean troca = true;
+               int aux;
+               while (troca) {
+                   troca = false;
+                   for (int i = 0; i < vetor.length - 1; i++) {
+                       if (vetor[i] > vetor[i + 1]) {
+                           aux = vetor[i];
+                           vetor[i] = vetor[i + 1];
+                           vetor[i + 1] = aux;
+                           troca = true;
+                       }
+                   }
+               }
+       }
+}

src/algoritmos/MergeSort.java

@@ -2,7 +2,7 @@
 
 import java.io.IOException;
 
-public class Mergesort {
+public class MergeSort {
 
 	public static void main(String[] args) throws IOException {
 		int quantidade = 10000;
@@ -45,7 +45,10 @@ private static void mergeSort(int[] a, int n) {
 	private static void merge(
       int[] a, int[] l, int[] r, int left, int right) {
 
-        int i = 0, j = 0, k = 0;
+        int i = 0;
+        int j = 0;
+        int k = 0;
+
         while (i < left && j < right) {
             if (l[i] <= r[j]) {
                 a[k++] = l[i++];

src/algoritmos/Quicksort.java

@@ -30,7 +30,9 @@ private static void quickSort(int[] vetor, int inicio, int fim) {
 
 	private static int posicaoPivor(int[] vetor, int inicio, int fim) {
 		int pivo = vetor[inicio];
-		int i = inicio + 1, f = fim;
+		int i = inicio + 1;
+		int f = fim;
+
 		while (i <= f) {
 			if (vetor[i] <= pivo)
 				i++;

src/algoritmos/SelectionSort.java

@@ -1,7 +1,5 @@
 package algoritmos;
 
-import java.io.IOException;
-
 public class SelectionSort {
 
 	public static void main(String args[]) {

src/exemplos/Main.java

@@ -0,0 +1,48 @@
+package exemplos;
+
+import java.io.BufferedReader;
+import java.io.FileReader;
+import java.io.IOException;
+
+public class Main {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		f(10);
+		readFile("");
+		validarString("omnilink");
+	}
+
+	public static long f(int n) {
+		if (n < 2) {
+            return n;
+        } else {
+            return f(n - 1) + f(n - 2);
+        }
+    }
+
+	public static String readFile(String fileName){ 
+	    BufferedReader br; 
+	    try { 
+	        br = new BufferedReader(new FileReader(fileName)); 
+	        final StringBuilder sb = new StringBuilder(); 
+	        String line = br.readLine(); 
+
+	        while (line != null) { 
+	            sb.append(line); 
+	            sb.append(System.lineSeparator()); 
+	            line = br.readLine(); 
+	        } 
+	        br.close(); 
+	        return sb.toString(); 
+	    } catch (IOException e) { 
+	        e.printStackTrace(); 
+	    } 
+	    return ""; 
+	}
+
+	public static boolean validarString(String entrada) {
+
+		return entrada != null && !entrada.equals("") && entrada.length() > 3;
+	}
+}