How to make a list of all players sorted from closest to farthest

[floral lodge]

^

[heavy token]

Create two List<Player> Variable's, one called Unsorted Players, one called Sorted Players

You will need a loop for this to be instant, so lets use a For chip, and run from 0, to List Get Count, where the list in question is the players you want to sort from closest to furthest from X

Before running the For chip, set Unsorted Players to your player list (A copy of it if its from a variable or event), and set Sorted Players to a blank list, using a List Create with no inputs

When the loop is run, when Loop fires, get the closest person in Unsorted Players to your target, and add them to Sorted Players, after, remove that player from Unsorted Players

When Done fires, Sorted Players will return a list of all players in the initial list, sorted from closest to furthest

[floral lodge]

yeah I had this idea and tried it out but I may have done it worng, Ill give it another shot thanks

[heavy token]

Remember that execution order matters, add them to Sorted Players BEFORE you remove them from Unsorted Players

[floral lodge]

yeah

[violet helm]

Idk, I would use a get all players, then use (however many player count is) get element chips then I would use the same amount of get distance chips then I would shove those in another list

Then I would sort that list

[heavy token]

So what your saying is you would rather do a hardcoded, unoptimized method that explodes your CPU, rather than doing my easier, optimized method?

[violet helm]

That doesn’t explode your cpu

It updates at without a for each

[heavy token]

Just because something uses a For Each doesnt mean its 100% CPU instantly

[violet helm]

Does list sort have an execute

[heavy token]

Sometimes you need to use a For chip

[heavy token]

List Sort doesnt work on a player list

Also, instantly, your method is bad because its hard coded

You cant just get the element of every player, what if there is no player in that slot yet? you run into an index is out of range error

[violet helm]

No you would get the index of the distances from smallest to largest

[heavy token]

You are using more data then you have to for literally no reason

[violet helm]

And take that from the original list

[violet helm]

Give me a sec

[heavy token]

if you send a screenshot I can assure you im going to vomit

[floral lodge]

works like a dream

[heavy token]

I would use List Remove At with the "Closest Index" output on the Get Closest chip, pretty sure its cheaper

[floral lodge]

changed it

[heavy token]

I have just realised a possible flaw in this system, and I bring a solution

Delete the For chip, replace with a Execution Integer Switch, with the outputs 0 and Failed
Failed = Loop
0 = Done
The Match should be the List Get Count of the Unsorted list variable

Connect the List Remove At execution output back into the Execution Integer Switch

This should function in theory the exact same way, but better and without possible bugs
It basically continues until there are no more items in the list, rather than executing once for each item in the intial list

[floral lodge]

smart way to get arround that

[heavy token]

huh?

[violet helm]

Some random mind mapping map but this would be with two players, (otherwise you would just filter out the invalids)

[heavy token]

I can't even call that unoptimized because I dont even think that works even remotely

[violet helm]

Ik I didn’t go in more details but do you see what I think could work