good

Nice

Ok sooo for task with Large array what is the type of Sort you advises ?

The sorting approach is generally less efficient for this specific task, especially when dealing with large arrays, due to the higher time complexity of the sorting algorithm. The looping approach focuses on finding only the two smallest numbers, resulting in better performance for this particular requirement.

how dose the code runs? your code gives me sort is not a function 😕

what is the point in storing the result of running sort method on the array if it's an 'in-place' algorithm?

He did not do the same thing. The .sort() method has a time complexity of O(n log(n)). This algo can be solved with one simple for loop as seblm described with a time complexity of O(n), which will be far more performant as your array grows in size.

ofcourse its a performance killer, but we try to be smart here by providing a solution with less lines possible.

mine is just fine smaller and confined

whats the difference than? you did the same thing.

Thank you for the answer!

in js, sort by itself works by comparing strings, so the use of a - b coerces those two values into a number (less than zero, zero, or greater than zero)

I'm new to js. Why does sort without arguments not work?

What if the smallest numbers were decimals and the coding instructions state to add two whole numbers. Your code should also take into account the length of the array, because the instructions say you should have a minimum of 4 elements in the array. This code doesn't account for everything.