O(n²) Example 2

o(n²)_2.js

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)
}