Question

How to sort the SortedList in the descending order with C#

Answer 1

using System;
using System.Collections.Generic;

class DecendingComparer<TKey>: IComparer<int>
{
    public int Compare(int x, int y)
    {
        return y.CompareTo(x);
    }
}

class Program
{
    static void Main() {
        SortedList<int, int> sl = new SortedList<int, int>(new DecendingComparer<int>());
        
        sl.Add(3, 1);
        sl.Add(0, 2);
        sl.Add(9, 3);
        sl.Add(5, 4);
        sl.Add(2, 5);

        for (int i = 0; i < sl.Count; i++) {
            Console.WriteLine("key: {0}, value: {1}", sl.Keys[i], sl.Values[i]);
        }
    }
}




/*
run:
  
key: 9, value: 3
key: 5, value: 4
key: 3, value: 1
key: 2, value: 5
key: 0, value: 2
  
*/

 

70+ SQL courses for beginners and professionals

Answer 2

using System;
using System.Collections.Generic;

class Program
{
    static void Main() {
        var descendingComparer = Comparer<int>.Create((x, y) => y.CompareTo(x));
        
        SortedList<int, int> sl = new SortedList<int, int>(descendingComparer);
        
        sl.Add(3, 1);
        sl.Add(0, 2);
        sl.Add(9, 3);
        sl.Add(5, 4);
        sl.Add(2, 5);

        for (int i = 0; i < sl.Count; i++) {
            Console.WriteLine("key: {0}, value: {1}", sl.Keys[i], sl.Values[i]);
        }
    }
}




/*
run:
  
key: 9, value: 3
key: 5, value: 4
key: 3, value: 1
key: 2, value: 5
key: 0, value: 2
  
*/

 

70+ SQL courses for beginners and professionals