Forked from anonymous/bonfire-where-do-i-belong.js
Created
December 10, 2015 18:40
-
-
Save duggiemitchell/6c58b13875464158b566 to your computer and use it in GitHub Desktop.
http://www.freecodecamp.com/duggiemitchell '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: @duggiemitchell | |
// Challenge: http://www.freecodecamp.com/challenges/bonfire-where-do-i-belong | |
// Learn to Code at Free Code Camp (www.freecodecamp.com) | |
function where(arr, num) { | |
arr.push(num); | |
arr.sort(); | |
var newArr = arr.sort(function(a,b) { | |
return a - b; | |
}); | |
return newArr.indexOf(num); | |
} | |
where([2, 20, 10], 19); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Return the lowest index at which a value (second argument) should be inserted into an array (first argument) once it has been sorted.
First,
push(num)
to the end of arrayI thought it would be as simple as just using
sort()
on the array, but it didnt do anything.So, the
sortCompare
function is needed to sort numbers.Lastly, just simply needed to return the
indexOf num
within the array.