merge: FindSecondLargestElement: Support negative numbers (TheAlgorithms#1036)

appgurueu · github-actions · web-flow · commit dbffac253d89 · 2022-06-03T22:37:49.000+05:30
* FindSecondLargestElement: Support negative numbers

* Updated Documentation in README.md

Co-authored-by: github-actions &lt;${GITHUB_ACTOR}@users.noreply.github.com&gt;
diff --git a/DIRECTORY.md b/DIRECTORY.md
@@ -142,6 +142,7 @@
   * [BinaryExponentiationRecursive](Maths/BinaryExponentiationRecursive.js)
   * [BisectionMethod](Maths/BisectionMethod.js)
   * [CheckKishnamurthyNumber](Maths/CheckKishnamurthyNumber.js)
+  * [CollatzSequence](Maths/CollatzSequence.js)
   * [Coordinate](Maths/Coordinate.js)
   * [CoPrimeCheck](Maths/CoPrimeCheck.js)
   * [DecimalExpansion](Maths/DecimalExpansion.js)
@@ -159,13 +160,15 @@
   * [FigurateNumber](Maths/FigurateNumber.js)
   * [FindHcf](Maths/FindHcf.js)
   * [FindLcm](Maths/FindLcm.js)
+  * [FindMaxRecursion](Maths/FindMaxRecursion.js)
   * [FindMin](Maths/FindMin.js)
   * [FindMinIterator](Maths/FindMinIterator.js)
   * [GetEuclidGCD](Maths/GetEuclidGCD.js)
   * [GridGet](Maths/GridGet.js)
   * [IsDivisible](Maths/IsDivisible.js)
   * [IsEven](Maths/IsEven.js)
   * [IsOdd](Maths/IsOdd.js)
+  * [IsPronic](Maths/IsPronic.js)
   * [LeapYear](Maths/LeapYear.js)
   * [LinearSieve](Maths/LinearSieve.js)
   * [LucasSeries](Maths/LucasSeries.js)
@@ -197,6 +200,7 @@
   * [SquareRoot](Maths/SquareRoot.js)
   * [SumOfDigits](Maths/SumOfDigits.js)
   * [SumOfGeometricProgression](Maths/SumOfGeometricProgression.js)
+  * [TwinPrime](Maths/TwinPrime.js)
   * [Volume](Maths/Volume.js)
   * [WhileLoopFactorial](Maths/WhileLoopFactorial.js)
   * [ZellersCongruenceAlgorithm](Maths/ZellersCongruenceAlgorithm.js)
diff --git a/Sorts/FindSecondLargestElement.js b/Sorts/FindSecondLargestElement.js
@@ -11,7 +11,7 @@
 
 const secondLargestElement = (array) => {
   const largestElement = Math.max(...array)
-  let element = 0
+  let element = -Number.MAX_VALUE
 
   for (let i = 0; i < array.length; i++) {
     if (element < array[i] && array[i] !== largestElement) {
