Array sort - to find "top ten"

You can add the items to the list and sort the list (descending). You should then take the 10 first items.

This is not the quickest possible solution. You should test it and see if it works quick enough.

This may work.

Put the first ten distances in a list (I will call it results), then sort results - sort it descending so the largest value is in results.Get(0).

loop through the rest of the distances -

when the distance is smaller than results.Get(0):
results.RemoveAt(0)
results.Add (distance)
results.Sort (False)

This means you only go through your distances once.

Thanks Erel & Kickaha,

I am trying the list sort at the moment.

Kickaha - its an interesting idea for a solution.

i will try both out & report back.

Best wishes

refsmmat

Sorry to impose - I may need some further advice.

The purpose of the sort was to find the closest point, but maintain its index in the original list. A list sort of the distance values can't mantian the original index.
The reason i need this, as the distance value from
maintained the index of the location/site names.


I have used a list to sort the top ten, but at this point I have to take the top ten values and find them individually to re-establish the original list index - in order to grab the site name.

having said that the list sort was very fast & the code is much better now - despite the slightly clunky way of reestablishing the index.

Is there an alternative sort function that can be used to preserve the original index?

Thanks,

refsmmat

You could define a type:

Type DistDetail(Distance As Long, Index As Int)

Then in your loop:

Then you can use SortType on the distance field, so you can always find the index of any distance.

There is no logical reason to store more than 10 distances.

As you calculate each distance:
If number of items in distance list is less than 10 or new distance is less than last item in distance list
then Do Insertion Sort into distance list
else ignore new distance

Most of the 160,000 distances will get ignored and you only deal with each distance once.

Bluejay

Thanks Kickaha,
"defining a type" = a structure? Sorry - I learnt programming using MATLAB.

Using your suggestion will work & fits nicely with the code I have so far. I know I was asking for an index value, but really I only need the index to refernece the town names in the reference array.

The reference array is lat, long, town name for each row.

Hi Bluejay,

Thanks for the suggestion. originally I wasn't storing all of the distances but I ran into problems in other ways. Im still on the way to the best solution.
I haven't heard of an insertion sort - it sounds like a good idea.

I will post the search code when I get it finished (I will need a few days).

Best wishes,

refsmmat

list sort solution

Apologies,

I meant to reply to this sooner.
I tried a lot of the more appropriate list sort algorithms, but each had their own drawbacks - primarily execution time (as the postcode list is quite large).

I came up with a good solution. It is not pretty, but it works very well.

1. Do a first pass search (based on initial lat/long) to identify array elements within "N" kilometres. Transpose these to a new array. If "N" is too small (I.E. a rural area where there are no towns/post offices within "N" kilometres, "N" is grown until at least 50 or so towns are identified.

2. Perform the sort operation on the new (much shorter) array. I used a less efficient sort technique that maintained my indexing - the efficiency didn't matter as the list size is smaller.

3. As the device moves away from the point outlined in 1. we perform a resort (rerun step 1) once the device moves more than "M" kilometres away from the origin. When this is done, the lat/long where the resort is performed
becomes the new origin.

Not exactly elegant, but it works nicely.
Thanks again for all of your advice.
Regards,


refsmmat