Big-O
.calc
JAVASCRIPT
// Type or paste code here... function findDupes(arr) { for(let i=0; i<arr.length; i++) { for(let j=i+1; j<arr.length; j++) { if(arr[i] === arr[j]) { return true; } } } return false; }
Estimate Complexity
O(n²)
Quadratic Time
Performance degrades steeply as input grows.
0
Loops
0
Max Nesting
Back to Editor