Ggthjy

How did passengers keep warm on sail ships?

Why can't wing-mounted spoilers be used to steepen approaches?

Nested ellipses in tikzpicture: Chomsky hierarchy

What aspect of planet Earth must be changed to prevent the industrial revolution?

What to do when moving next to a bird sanctuary with a loosely-domesticated cat?

What can I do if neighbor is blocking my solar panels intentionally?

How to read αἱμύλιος or when to aspirate

Was credit for the black hole image misappropriated?

Make it rain characters

Would an alien lifeform be able to achieve space travel if lacking in vision?

What does Linus Torvalds mean when he says that Git "never ever" tracks a file?

Is 'stolen' appropriate word?

Why don't hard Brexiteers insist on a hard border to prevent illegal immigration after Brexit?

Could an empire control the whole planet with today's comunication methods?

Circular reasoning in L'Hopital's rule

Can a flute soloist sit?

Did the UK government pay "millions and millions of dollars" to try to snag Julian Assange?

Is there a writing software that you can sort scenes like slides in PowerPoint?

Can we generate random numbers using irrational numbers like π and e?

For what reasons would an animal species NOT cross a *horizontal* land bridge?

Accepted by European university, rejected by all American ones I applied to? Possible reasons?

ELI5: Why do they say that Israel would have been the fourth country to land a spacecraft on the Moon and why do they call it low cost?

Can the DM override racial traits?

Does Parliament hold absolute power in the UK?

Sort list of Array Linked Object by keys and values

.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ margin-bottom:0;
}

0

$begingroup$

Lets say I have this data:

let trips = [

  {

    from: "DEN",

    to: "JFK"

  },

  {

    from: "SEA",

    to: "DEN"

  },

  {

    from: 'JFK',

    to: 'SEA'

  },

];

and my origin is 'JFK', I want to sort the list by how I have traveled. So for instance, this should be the end result:

let trips = [

  {

    from: 'JFK',

    to: 'SEA'

  },

  {

    from: "SEA",

    to: "DEN"

  },

  {

    from: "DEN",

    to: "JFK"

  },

];

My solution works but it's not very well written, but I tried!

Any help would be great.

function sortByLinked(trips, origin = 'JFK') {

  let sortedArray = [];



  let first = trips.filter(trip => trip.from === origin)[0];

  sortedArray.push(first);



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

    if(sortedArray[0].to === trips[i].from) {

      sortedArray.push(trips[i]);

    }

  }



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

    if(sortedArray[1].to === trips[i].from) {

      sortedArray.push(trips[i]);

    }

  }



  return sortedArray;

}



sortByLinked(trips) 

javascript algorithm

share|improve this question

asked 23 mins ago

Shivam BhallaShivam Bhalla

1725

$endgroup$

migrated from stackoverflow.com 2 mins ago

This question came from our site for professional and enthusiast programmers.

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  is it like the origin and final destination always the same? and how many intermediate trips are going to be present?
  $endgroup$
  – karthick
  19 mins ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Is from unique for all elements?
  $endgroup$
  – Taplar
  17 mins ago
  

  
  
  
  

add a comment | 

0

$begingroup$

Lets say I have this data:

let trips = [

  {

    from: "DEN",

    to: "JFK"

  },

  {

    from: "SEA",

    to: "DEN"

  },

  {

    from: 'JFK',

    to: 'SEA'

  },

];

and my origin is 'JFK', I want to sort the list by how I have traveled. So for instance, this should be the end result:

let trips = [

  {

    from: 'JFK',

    to: 'SEA'

  },

  {

    from: "SEA",

    to: "DEN"

  },

  {

    from: "DEN",

    to: "JFK"

  },

];

My solution works but it's not very well written, but I tried!

Any help would be great.

function sortByLinked(trips, origin = 'JFK') {

  let sortedArray = [];



  let first = trips.filter(trip => trip.from === origin)[0];

  sortedArray.push(first);



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

    if(sortedArray[0].to === trips[i].from) {

      sortedArray.push(trips[i]);

    }

  }



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

    if(sortedArray[1].to === trips[i].from) {

      sortedArray.push(trips[i]);

    }

  }



  return sortedArray;

}



sortByLinked(trips) 

javascript algorithm

share|improve this question

asked 23 mins ago

Shivam BhallaShivam Bhalla

1725

$endgroup$

migrated from stackoverflow.com 2 mins ago

This question came from our site for professional and enthusiast programmers.

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  is it like the origin and final destination always the same? and how many intermediate trips are going to be present?
  $endgroup$
  – karthick
  19 mins ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Is from unique for all elements?
  $endgroup$
  – Taplar
  17 mins ago
  

  
  
  
  

add a comment | 

$begingroup$

Lets say I have this data:

let trips = [

  {

    from: "DEN",

    to: "JFK"

  },

  {

    from: "SEA",

    to: "DEN"

  },

  {

    from: 'JFK',

    to: 'SEA'

  },

];

and my origin is 'JFK', I want to sort the list by how I have traveled. So for instance, this should be the end result:

let trips = [

  {

    from: 'JFK',

    to: 'SEA'

  },

  {

    from: "SEA",

    to: "DEN"

  },

  {

    from: "DEN",

    to: "JFK"

  },

];

My solution works but it's not very well written, but I tried!

Any help would be great.

function sortByLinked(trips, origin = 'JFK') {

  let sortedArray = [];



  let first = trips.filter(trip => trip.from === origin)[0];

  sortedArray.push(first);



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

    if(sortedArray[0].to === trips[i].from) {

      sortedArray.push(trips[i]);

    }

  }



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

    if(sortedArray[1].to === trips[i].from) {

      sortedArray.push(trips[i]);

    }

  }



  return sortedArray;

}



sortByLinked(trips) 

javascript algorithm

share|improve this question

asked 23 mins ago

Shivam BhallaShivam Bhalla

1725

$endgroup$

let trips = [

  {

    from: "DEN",

    to: "JFK"

  },

  {

    from: "SEA",

    to: "DEN"

  },

  {

    from: 'JFK',

    to: 'SEA'

  },

];

let trips = [

  {

    from: 'JFK',

    to: 'SEA'

  },

  {

    from: "SEA",

    to: "DEN"

  },

  {

    from: "DEN",

    to: "JFK"

  },

];

function sortByLinked(trips, origin = 'JFK') {

  let sortedArray = [];



  let first = trips.filter(trip => trip.from === origin)[0];

  sortedArray.push(first);



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

    if(sortedArray[0].to === trips[i].from) {

      sortedArray.push(trips[i]);

    }

  }



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

    if(sortedArray[1].to === trips[i].from) {

      sortedArray.push(trips[i]);

    }

  }



  return sortedArray;

}



sortByLinked(trips) 

share|improve this question

asked 23 mins ago

Shivam BhallaShivam Bhalla

1725

share|improve this question

asked 23 mins ago

Shivam BhallaShivam Bhalla

1725

asked 23 mins ago

Shivam BhallaShivam Bhalla

1725

asked 23 mins ago

Shivam BhallaShivam Bhalla

1725