Sort array using selection sort

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace MaxArrayElement
{
    class MaxArrayElement
    {
        static void Main(string[] args)
        {
            Console.Write("Please ENTER index, where to start the search: ");
            int n = int.Parse(Console.ReadLine());
            int[] array = new int[15];


            ArrayGenerator(array);
            Console.Write("Initial array: ");
            PrintArray(array);

            Console.WriteLine("The biggest int in the selected range is: " + BiggestElement(array, n));
            Console.Write("\nIn ascending order: ");
            //Трябва да бъде 0 вместо n за да  може да сортира целия масив, както се изисква
            int[] sortedArray = AscendingOrder(array, 0);

            PrintArray(sortedArray);
        }
        public static int BiggestElement(int[] array, int n)
        {

            int max = int.MinValue;
            for (int index = n; index < array.Length; index++)
            {
                if(array[index] > max)
                {
                    max = array[index];
                }
            }
            return max;

        }

        private static void PrintArray(int[] array)
        {
            for (int index = 0; index < array.Length; index++)
            {
                Console.Write(array[index] + " ");
            }
            Console.WriteLine("\n");
        }

        static int[] AscendingOrder(int[] array, int n)
        {
            //Това е quicksort. Не изпозлва метода BiggestElement (или подобен)
            //Array.Sort(arr2);

            List<int> listToSort = new List<int>(array);
            List<int> sortedlist = new List<int>();
            int currentBiggestElement;

            while (listToSort.Count > 0)
            {
                currentBiggestElement = BiggestElement(listToSort.ToArray(), n);
                sortedlist.Insert(0, currentBiggestElement);
                listToSort.Remove(currentBiggestElement);
            }

            return sortedlist.ToArray();

            //List<int> sortedlist = SortArrayAscending(array);


        }

        //private static List<int> SortArrayAscending(int[] arrayToSort)
        //{

        //}

        public static void ArrayGenerator(int[] array)
        {
            Random creator = new Random();

            for (int index = 0; index < array.Length; index++)
            {
                array[index] = creator.Next(31);
            }
        }
    }
}