mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 15:39:42 +08:00
merge: FindSecondLargestElement: Support negative numbers (#1036)
* FindSecondLargestElement: Support negative numbers * Updated Documentation in README.md Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
@ -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,6 +160,7 @@
|
||||
* [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)
|
||||
@ -166,6 +168,7 @@
|
||||
* [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)
|
||||
|
@ -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) {
|
||||
|
Reference in New Issue
Block a user