IMPORTANT

NO PLAGIARISM WILL BE TOLERATED. We run every test through our plagiarism tool and you will be removed from the list of potential candidates if we find that you have copy pasted code from the web.

We believe that most people are honest, professional individuals, and we wish to provide candidates a familiar, and stress-free environment to do the test in.

We also believe that you should have access to the internet for this test, as in real life, you will sometimes have no choice but to refer to the internet in order to solve a complex problem.

Feel free to research ways to solve the two questions in this test, but try to be different and innovative when creating a solution. DO NOT PLAGIARIZE.

Instructions

1. Fork this repo to your work station.
2. Answer the following questions by creating a JavaScript file for each of the questions.
3. Commit and push your code to your fork.
4. Create a pull request back to the master branch of the origin repo.

Questions

1. Create a function that takes an unlimited amount of number parameters, and returns an array of all the permutations possible. For example, myFunction(4, 7, 2) {} should return [472, 427, 724, 742, 247, 274].

2. Create a function that can find the Nth smallest number in an array. The array can be very very big, so you are not allowed using the Array.sort() method. Try to build a function that would perform fast. Also, explain why using Array.sort() isn't a good idea when sorting large arrays.