Skip to content

Instantly share code, notes, and snippets.

@tcelovsky
Created Jul 9, 2021
Embed
What would you like to do?
O(n²) Example 2
const numbers = [1, 2, 3, 4, 5]
function logAndSum(numbers) {
for (let i = 0; i < numbers.length; i++) { //O(n) --> linear time (run time increases at the same pace as the input)
for (let j = 0; j < numbers.length; j++) { //O(n) --> linear time (run time increases at the same pace as the input)
console.log(numbers[i]); //O(1) --> constant time (basic operation)
}
}
const sum = numbers.reduce((acc, number) => { //O(n) --> linear time (run time increases at the same pace as the input)
return acc += number; //O(1) --> constant time (basic operation)
}, 0);
return sum; //O(1) --> constant time (basic operation)
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment