René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Aplicar técnica de Refactorización : Introduce Assertion. ","articleBody":"Dentro de la clase FibonacciEvenSum se tienen comentarios para los métodos fibonacciCalculator, twoMatrixMultiplication y decompusitionInSumOfTwo. Estos comentarios representan un mal olor y son prácticamente innecesarios, ya que con la firma de dichos métodos es bastante obvia la función de cada método,  \r\n\r\n```\r\nimport java.lang.Math;\r\npublic class FibonacciEvenSum {\r\n\tstatic void evenSum(){\r\n\t\tint x=1, y=2, sum=0;\r\n\t\twhile(y\u003c4000000){\r\n\t\t\tif(y%2 == 0) sum+=y;\r\n\t\t\ty+=x;\r\n\t\t\tx=y-x;\r\n\t\t}\r\n\t\tSystem.out.println(\"The sum is \" + sum);\r\n\t}\r\n\r\n\tstatic int calculadorFibonacci(int term){\r\n\t\tint y=0, x=1, aux;\r\n\t\tfor(int i=1; i\u003cterm; i++){\r\n\t\t\taux = y;\r\n\t\t\ty=x;\r\n\t\t\tx=x+aux;\r\n\t\t}\r\n\t\treturn x;\r\n\t}\r\n\r\n\tstatic int[][] multiplicarDosMatrices(int matrix1[][], int matrix2[][]){\r\n\t\tint[][] result = new int[2][2];\r\n\t\tresult[0][0]=matrix1[0][0] * matrix2[0][0] + matrix1[0][1] * matrix2[1][0];\r\n\t\tresult[0][1]=matrix1[0][0] * matrix2[0][1] + matrix1[0][1] * matrix2[1][1];\r\n\t\tresult[1][0]=matrix1[1][0] * matrix2[0][0] + matrix1[1][1] * matrix2[1][0];\r\n\t\tresult[1][1]=matrix1[1][0] * matrix2[0][1] + matrix1[1][1] * matrix2[1][1];\r\n\t\treturn result;\r\n\t}\r\n\t\r\n\tstatic int[] descomponerEnSumaDeDos(int fibonacciTerm){\r\n\t\tint[] result = new int[8];\r\n\t\tint k=7;\r\n\t\tfor(int i=7; i>=0; i--){\r\n\t\t\tif(fibonacciTerm - Math.pow(2,i)>=0){\r\n\t\t\t\tresult[k] = 1;\r\n\t\t\t\tfibonacciTerm = (int) (fibonacciTerm - Math.pow(2, i));\r\n\t\t\t}\r\n\t\t\tk--;\r\n\t\t}\r\n\t\treturn result;\r\n\t}\r\n```","author":{"url":"https://github.com/tyrerodr","@type":"Person","name":"tyrerodr"},"datePublished":"2020-08-25T07:27:04Z","url":"https://github.com/JavaSummer/JavaMainRepo/issues/124"}