= 27d567bc2d48d9f40e9ccc20ea370b15)
saturn comments on Quixey Engineering Screening Questions - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (22)
Are the requirements for problem 2 intended to rule out any form of recursion?
No.
Not sure what all being said above, but cant it be done in just a simple way like
<SCRIPT LANGUAGE="JavaScript"> <!-- Begin function fireup(i) { alert(i); i=i+1; if(i>10) { return false; }else{ fireup(i); }
} // End --> </script>
I accept, one gets good set of logics from a good and sound education, but i have to say that in field programing a lot of time experience helps to get simple and straight forward solution for your requirements. Optimization can follow on.
This solution is correct, but only works up to i ~= 30,000 because of stack depth limits.