Ttykuu

Why is indicated airspeed rather than ground speed used during the takeoff roll?

Why is participating in the European Parliamentary elections used as a threat?

How to find the largest number(s) in a list of elements, possibly non-unique?

Turning a hard to access nut?

label a part of commutative diagram

pipe commands inside find -exec?

Animating wave motion in water

Emojional cryptic crossword

Error in master's thesis, I do not know what to do

Friend wants my recommendation but I don't want to

Knife as defense against stray dogs

What is the tangent at a sharp point on a curve?

Nested Dynamic SOQL Query

Why is "la Gestapo" feminine?

Hot air balloons as primitive bombers

Have any astronauts/cosmonauts died in space?

PTIJ: At the Passover Seder, is one allowed to speak more than once during Maggid?

Why doesn't the fusion process of the sun speed up?

Why are there no stars visible in cislunar space?

Why is there so much iron?

Imaginary part of expression too difficult to calculate

Should a narrator ever describe things based on a characters view instead of fact?

Do people actually use the word "kaputt" in conversation?

How are passwords stolen from companies if they only store hashes?

Finding nth lowest value without any Math max or min methods

Finding the pairs of intersecting discsCalculating the Nth number in the supertable of two numbersThe longest subsequence with specified difference between min and maxArray is MinMax Equal or NotFinding the longest sequence of positive numbers in integer arrayChecking whether the max and min values occur equally frequently“Max Min” in HackerRankgroupArray() - Convert flat array into multidimensional array by groupCalculate min, max, mean and median out of arrayCalculate min, max, mean and median out of array Version 2

0

$begingroup$

So I decided to make a more efficient solution to a Google interview question where they ask you to either find the lowest or second lowest value in an array without using the max or min methods. I believe it is more efficient because you can use my method to find any nth lowest value in the array so it solves for all cases.

Please let me know if there is anything I can do to improve this solution or if there is anything I am missing:

/*Algorithm:
-first sort the array from ascending order
-Then iterate over the array with a loop
-if(array[i + nth lowest input you want])
-return the output

function nThOrderStatistic(array, number):
 -if you want to find the lowest number sub in 0 for number 
 -for every nth lowest you want sub in n - 1 for the number */


function nThOrderStatistic(array, number) 
 array.sort(function(a,b)return a -b);
 for(i = 0; i < array.length; i++)
 
 if(array[i + number] < array[i + (number + 1)])
 
 return array[i + number];
 
 


nThOrderStatistic([6,7,43,2,95], 2);

//sample output for 3rd lowest value is: 7 //

javascript algorithm programming-challenge array functional-programming

share

asked 6 mins ago

DreamVision2017DreamVision2017

161

$endgroup$

add a comment | 

0

$begingroup$

So I decided to make a more efficient solution to a Google interview question where they ask you to either find the lowest or second lowest value in an array without using the max or min methods. I believe it is more efficient because you can use my method to find any nth lowest value in the array so it solves for all cases.

Please let me know if there is anything I can do to improve this solution or if there is anything I am missing:

/*Algorithm:
-first sort the array from ascending order
-Then iterate over the array with a loop
-if(array[i + nth lowest input you want])
-return the output

function nThOrderStatistic(array, number):
 -if you want to find the lowest number sub in 0 for number 
 -for every nth lowest you want sub in n - 1 for the number */


function nThOrderStatistic(array, number) 
 array.sort(function(a,b)return a -b);
 for(i = 0; i < array.length; i++)
 
 if(array[i + number] < array[i + (number + 1)])
 
 return array[i + number];
 
 


nThOrderStatistic([6,7,43,2,95], 2);

//sample output for 3rd lowest value is: 7 //

javascript algorithm programming-challenge array functional-programming

share

asked 6 mins ago

DreamVision2017DreamVision2017

161

$endgroup$

add a comment | 

$begingroup$

So I decided to make a more efficient solution to a Google interview question where they ask you to either find the lowest or second lowest value in an array without using the max or min methods. I believe it is more efficient because you can use my method to find any nth lowest value in the array so it solves for all cases.

Please let me know if there is anything I can do to improve this solution or if there is anything I am missing:

/*Algorithm:
-first sort the array from ascending order
-Then iterate over the array with a loop
-if(array[i + nth lowest input you want])
-return the output

function nThOrderStatistic(array, number):
 -if you want to find the lowest number sub in 0 for number 
 -for every nth lowest you want sub in n - 1 for the number */


function nThOrderStatistic(array, number) 
 array.sort(function(a,b)return a -b);
 for(i = 0; i < array.length; i++)
 
 if(array[i + number] < array[i + (number + 1)])
 
 return array[i + number];
 
 


nThOrderStatistic([6,7,43,2,95], 2);

//sample output for 3rd lowest value is: 7 //

javascript algorithm programming-challenge array functional-programming

share

asked 6 mins ago

DreamVision2017DreamVision2017

161

$endgroup$

/*Algorithm:
-first sort the array from ascending order
-Then iterate over the array with a loop
-if(array[i + nth lowest input you want])
-return the output

function nThOrderStatistic(array, number):
 -if you want to find the lowest number sub in 0 for number 
 -for every nth lowest you want sub in n - 1 for the number */


function nThOrderStatistic(array, number) 
 array.sort(function(a,b)return a -b);
 for(i = 0; i < array.length; i++)
 
 if(array[i + number] < array[i + (number + 1)])
 
 return array[i + number];
 
 


nThOrderStatistic([6,7,43,2,95], 2);

//sample output for 3rd lowest value is: 7 //

share

asked 6 mins ago

DreamVision2017DreamVision2017

161

share

asked 6 mins ago

DreamVision2017DreamVision2017

161

asked 6 mins ago

DreamVision2017DreamVision2017

161

asked 6 mins ago

DreamVision2017DreamVision2017

161