Remove signature

Author: kelvins

src/c/SentinelSearch.c

@@ -1,7 +1,6 @@
 /*
 *	Exemplo de Busca Sentinela em C
 *	Objetivo: Encontrar um valor em um vetor sem precisar testar todos os valores dentro do laço
-*	Kelvin Salton do Prado - 2015
 */
 
 #include <stdio.h>
@@ -25,7 +24,7 @@ int buscaSentinela(int vetor[], int chave){
 int main(){
 
 	int vetor[TAM_VETOR+1]; // Declara o vetor com +1 pois é a posição que será utilizada pela sentinela
-	
+
 	// Preenche o vetor com valores aleatórios 0-1000
 	srand(time(NULL));
 	for(int i = 0; i < TAM_VETOR; i++){
@@ -39,6 +38,6 @@ int main(){
 		printf("\n\nValor %d encontrado na posicao %d.\n\n", vetor[res], res);
 	else
 		printf("\n\nValor não encontrado no vetor\n\n");
-	
+
 	return 0;
 }

src/cpp/Palindrome.cpp

@@ -1,11 +1,9 @@
 /*
 isPalindrome Algorithm in C++
-Ricardo Ferreira Carvalheira - 2023
-https://github.com/ricardocarva
 
-    A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers.
+A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers.
 
-    Given a string s, return true if it is a palindrome, or false otherwise.
+Given a string s, return true if it is a palindrome, or false otherwise.
 */
 #include <iostream>
 
@@ -53,4 +51,4 @@ int main() {
         std::cout << "The string is not a palindrome." << std::endl;
     }
     return 0;
-}
+}

src/cpp/TowerOfHanoi.cpp

@@ -1,7 +1,5 @@
 /*
     Recursive Towers of Hanoi Solution
-    Thomas Martin - 2023
-    https://github.com/thomas-martin-uf
 
     Problem Description: (from wikipedia)
     The Tower of Hanoi is a mathematical game or puzzle consisting of three rods and a number of disks of various diameters,
@@ -67,4 +65,4 @@ int main()
     // output result
     cout << "Total moves needed to solve: " << num_moves;
     return 0;
-}
+}

src/go/dijkstra.go

@@ -1,6 +1,5 @@
 /*
 * Grafos - Algoritmo de Dijkstra em Go
-* Danilo Moura - 2020
 * Complexidade: Teta(n^2)
 * Implementação utilizando matriz de adjacências (matriz de distância)
 *

src/go/lista_sequencial_nao_ordenada.go

@@ -1,6 +1,5 @@
 /*
 * Listas - Lista linear não ordenada
-* Danilo Moura - 2020
 *
 * Implementação da lista sequencial cujos elementos não estão ordenados
 *

src/go/lista_sequencial_ordenada.go

@@ -1,6 +1,5 @@
 /*
 * Listas - Lista linear ordenada
-* Danilo Moura - 2020
 *
 * Implementação da lista sequencial cujos elementos estão ordenados
 *

src/java/AddTwoNumbers.java

@@ -3,10 +3,6 @@
 import java.util.List;
 
 // Utilized OpenJDK 17.0.3
-/*
- * @author Gabriel Nascimento. GitHub: Gabrielxdf
- *
- */
 public class AddTwoNumbers {
   /**
    * This program takes a list of numbers and checks if there are two numbers whose sum is equal to

src/java/BogoSort.java

@@ -1,6 +1,3 @@
-/*
- * @author Marcelo Wischniowski <marcelowisc at gmail.com>
- */
 public class BogoSort {
 
   public static int[] bogoSort(int[] vector) {

src/java/BucketSort.java

@@ -1,6 +1,3 @@
-/*
- * @author Marcelo Wischniowski <marcelowisc at gmail.com>
- */
 public class BucketSort {
 
   /**

src/java/HeapSort.java

@@ -1,6 +1,3 @@
-/*
- * @author Marcelo Wischniowski <marcelowisc at gmail.com>
- */
 public class HeapSort {
 
   /**

src/java/RadixSort.java

@@ -1,6 +1,3 @@
-/*
- * @author Marcelo Wischniowski <marcelowisc at gmail.com>
- */
 public class RadixSort {
 
   /**

src/java/ShellSort.java

@@ -1,6 +1,3 @@
-/*
- * @author Marcelo Wischniowski <marcelowisc at gmail.com>
- */
 public class ShellSort {
 
   /**

src/javascript/InsertionSort.js

@@ -1,6 +1,3 @@
-//Diogo L.C. Felipe
-//diogomem@outlook.com
-
 /*
    Insertion Sort is a sorting algorithm that works as follows:
    1. It iterates through the array from the second position onward.
@@ -32,4 +29,4 @@ function swapPositions(array, firstPosition, secondPosition) {
 var unsortedArray = [54, 42, 11, 33, 24, 99, 77, 80];
 let sortedArrayViaInsertionSort = insertionSort(unsortedArray, 0, unsortedArray.length);
 
-console.log(sortedArrayViaInsertionSort);
+console.log(sortedArrayViaInsertionSort);

src/javascript/InterpolationSearch.js

@@ -1,7 +1,4 @@
 /**
- * @author octaviolage
- * @version 1.0
- * @date 2022-07-31
  * @description Busca por interpolação
  * @reference https://en.wikipedia.org/wiki/Interpolation_search
  */
@@ -22,15 +19,15 @@ const interpolationSearch = (arr, first, last, value) => {
       return pos;
     else if (arr[pos] < value)
       return interpolationSearch(arr, pos + 1, last, value);
-    else 
+    else
       return interpolationSearch(arr, first, pos - 1, value);
   }
   return -1;
 }
 
 const main = () => {
   // The array needs to be sorted
-  const arr = [10, 12, 13, 16, 18, 19, 20, 21, 
+  const arr = [10, 12, 13, 16, 18, 19, 20, 21,
     22, 23, 24, 33, 35, 42, 47];
   let n = arr.length;
 

src/javascript/SelectionSort.js

@@ -1,6 +1,3 @@
-// Diogo L.C. Felipe
-// diogomem@outlook.com
-
 /*
    Selection Sort, or the selection sort algorithm, sorts a series of data
    as follows:
@@ -16,14 +13,14 @@ function selectionSort(unsortedArray, start, end) {
 	   let smallestPosition = findSmallestPosition(unsortedArray, i, end);
 	   [unsortedArray[smallestPosition], unsortedArray[i]] = [unsortedArray[i], unsortedArray[smallestPosition]];
 	}
- 
+
 	return unsortedArray;
  }
- 
+
  function findSmallestPosition(unsortedArray, start, end) {
 	let smallestPosition = start;
 	let smallest = unsortedArray[start];
- 
+
 	for (let i = start; i < end; i++) {
 	   if (unsortedArray[i] < smallest) {
 		  smallest = unsortedArray[i];
@@ -32,9 +29,9 @@ function selectionSort(unsortedArray, start, end) {
 	}
 	return smallestPosition;
  }
- 
+
  var unsortedArray = [54, 42, 11, 33, 24, 99, 77, 80];
  let sortedArrayViaSelectionSort = selectionSort(unsortedArray, 0, unsortedArray.length);
- 
+
  console.log(sortedArrayViaSelectionSort);
- 
+

src/kotlin/ExponentiationRecursive.kt

@@ -4,9 +4,6 @@
  * The *exponentiationRecursive* function presents the values of a number (*base*) raised by an *exponent*.
  * In this function, the concept of *recursion* is used, in which the created function is called within it, one or more times internally of the same.
  *
- * @author Algorithm version for Kotlin: Alfredo Paes <alfredo.alfpaes@gmail.com>
- * @see https://github.com/Alfredo-Paes
- *
  * @param base is of type integer (Int)
  * @param exponent is of type integer (Int)
  *

src/kotlin/Factorial.kt

@@ -3,9 +3,6 @@
  *
  * The *factorial* function presents the values of multiplying *n numbers* by their predecessors greater than or equal to 1.
  *
- * @author Algorithm version for Kotlin: Alfredo Paes <alfredo.alfpaes@gmail.com>
- * @see https://github.com/Alfredo-Paes
- *
  * @param number is of type integer (Int)
  *
  * @return will return a number of type *Long* in which the type is assigned to the *factorial* variable.

src/kotlin/FibonacciRecursive.kt

@@ -4,9 +4,6 @@
  * The *fibonacci* function displays the values of the Fibonacci sequence in which, the first two terms of this sequence are less than or equal to 1, and each term that follows next will be the sum of the two previous numbers (0, 1, 1, 2, 3, 5, 8...).
  * In this function, the concept of *recursion* is used, in which the created function is called within it, one or more times internally.
  *
- * @author Algorithm version for Kotlin: Alfredo Paes <alfredo.alfpaes@gmail.com>
- * @see https://github.com/Alfredo-Paes
- *
  * @param number is of type integer (Int)
  *
  * @return will return a logical condition if *number* is less than or equal to 1, returns 1 otherwise, the sum of itself using the concept of *recursion* to execute this sum.

src/python/arvore_binaria_de_busca.py

@@ -1,7 +1,5 @@
 """
 Arvore Binaria de Busca em Python
-Kelvin Salton do Prado
-2015
 """
 
 

src/python/busca_em_grafo.py

@@ -1,6 +1,4 @@
 # Grafos - Algoritmos de BFS e DFS em Python
-# Bruno Dantas de Paiva - 2021
-# https://github.com/DantasB
 
 from collections import deque
 

src/python/counting_sort.py

@@ -1,6 +1,4 @@
 # Algoritmo de ordenação Counting sort em Python
-# Vinicios Barbosa da Silva - 2023
-# https://github.com/ViniciosB
 
 import random
 

src/python/interpolation_search.py

@@ -1,6 +1,4 @@
 # Busca por interpolação em Python
-# Bruno Dantas de Paiva - 2021
-# https://github.com/DantasB
 
 
 def interpolation_search(array, x):

src/python/maximo_minimo_dc.py

@@ -1,6 +1,4 @@
 # Mínimo e Máximo de um array usando divide & conquer
-# Bruno Dantas de Paiva - 2021
-# https://github.com/DantasB
 
 import random