Andela challanges

mySortLongVersionjs

/* Write a mySort function which takes in an array integers, and should return an array of the inputed integers sorted such that the odd numbers come first and even numbers come last.
For exampl1e:
mySort( [90, 45, 66, 'bye', 100.5] )
should return
[45, 66, 90, 100] */let mySort = (nums) => {
  
  let sortNums = nums.sort( (a, b) => a - b );
  let filterNums = sortNums.map(num => Math.floor(num));
  let oddNums = [];
  let evenNums = [];
  

  for (var i = 0; i < filterNums.length; i++) {

    if (filterNums[i] % 2 === 0) {
      evenNums.push(filterNums[i]);
    } else if (filterNums[i] % 2 > 0) {
      oddNums.push(filterNums[i]);
    }
  };
  
  let newNums = oddNums.concat(evenNums);
      
 return newNums;
};
mySort([90, 45, 66, 'bye', 100.5]);