C# LINQ return counter array indices max to min

Question

A newbie with C# and LINQ. I have an array which is essentially a counted sequence.

{1,3,5,2,7,2}

I am trying to write a query that returns list of indices with highest values in descending order:

4,2,1,3,5,0

I can get the maximum index with this query below, but I can't seem to work out how to get the next indexes in sequence with a single query.

int index = array.ToList().IndexOf(array.Max());

Enigmativity · Accepted Answer · 2015-08-31 07:11:09Z

10

This works:

var list = new [] {1,3,5,2,7,2}; var indices = list .Select((n, i) => new { n, i }) .OrderByDescending(x => x.n) .Select(x => x.i) .ToArray();

answered Aug 31, 2015 at 7:11

117k12 gold badges101 silver badges184 bronze badges

Sign up to request clarification or add additional context in comments.

2 Comments

Thanks, Enigmativity!

@tarzan - If you like my answer don't forget to click the accept tick. :-)

Rahul Singh · Accepted Answer · 2015-08-31 07:11:36Z

You can use Select:-

var result = numbers.Select((v, i) => new { Value = v, Index = i }) .OrderByDescending(x => x.Value) .Select(x => x.Index).ToArray();