-
-
Save anonymous/f8faff40d6ad79a646f0 to your computer and use it in GitHub Desktop.
http://www.freecodecamp.com/nhancs 's solution for Bonfire: Where do I belong
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // Bonfire: Where do I belong | |
| // Author: @nhancs | |
| // Challenge: http://www.freecodecamp.com/challenges/bonfire-where-do-i-belong?solution=function%20where(arr%2C%20num)%20%7B%0A%20%20%2F%2F%20Find%20my%20place%20in%20this%20sorted%20array.%0A%20%20arr.sort(function(a%2C%20b)%7B%0A%20%20%20%20return%20a-b%3B%0A%20%20%7D)%3B%0A%20%20var%20arr_length%20%3D%20arr.length%3B%0A%20%20for%20(var%20i%20%3D%200%3B%20i%20%3C%20arr_length%3B%20i%2B%2B)%7B%0A%20%20%20%20if%20(num%20%3E%3D%20arr%5Bi%5D%20%26%26%20num%20%3C%3D%20arr%5Bi%2B1%5D)%20return%20(i%2B1)%3B%0A%20%20%7D%0A%20%20return%20arr_length%3B%0A%7D%0A%0Awhere(%5B40%2C%2060%5D%2C%2030)%3B%0A | |
| // Learn to Code at Free Code Camp (www.freecodecamp.com) | |
| function where(arr, num) { | |
| // Find my place in this sorted array. | |
| arr.sort(function(a, b){ | |
| return a-b; | |
| }); | |
| var arr_length = arr.length; | |
| for (var i = 0; i < arr_length; i++){ | |
| if (num >= arr[i] && num <= arr[i+1]) return (i+1); | |
| } | |
| return arr_length; | |
| } | |
| where([40, 60], 30); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment