/*

    1. Create a generic interface ITestInterface, with a method SpecialSort, that takes an IEnumerable as an input and returns an IEnumerable

    2. Add a class that implements ITestInterface

    3. Implement the SpecialSort method

        * Multiply each element by (index+1) and then sort descending without using a built-in method

    4. Instatiate the class in main, call SpecialSort and print the sorted values to the console

*/

​

using System;

using System.Linq;

using System.Collections.Generic;

public class Program

{

    public static void Main()

    {

        var list = new List<int>()

        { 3, 14, 35, 6, 1, 3, 1, 2, 4, 7 };

​

            var output = new TestClass<int>();

        Console.WriteLine(String.Join(",", output.SpecialSort(list)));

    }

}

​

    ///1. Create a generic interface ITestInterface, with a method SpecialSort, that takes an IEnumerable as an input and returns an IEnumerable

​

public interface ITestInterface<T>

{

    IEnumerable<T> SpecialSort(IEnumerable<T> input);

}   

​

//// 2. Add a class that implements ITestInterface

​

public class TestClass<T> :  ITestInterface<T>

{

    public IEnumerable<T> SpecialSort(IEnumerable<T> input)

    {

     //// Implement the SpecialSort method

        //// * Multiply each element by (index+1) and then sort descending without using a built-in method

        List<T> list  = new List<T>();

        var inputList = input.ToList();

        int index = 0;

        foreach(dynamic item in inputList)

        {           

            list.Add(item * (index + 1));

            index++;

        }

        for(int i = 0; i < list.Count ; i++ )

        {

            for(int j = i + 1; j < list.Count; j++)

            {

                if (list[j].GetHashCode() > list[i].GetHashCode())

                {

                    var temp = list[i];

                    list[i] = list[j];

                    list[j] = temp;

                }

            }

        }

        return list;

    }

}

​