Insertion sort

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

namespace Linear_Search
{
    class Program
    {
        static void Main(string[] args)
        {
            List<int> unsorted = new List<int>();
            Random generator = new Random();
            for (int i =0;i<20;i++)
            {
                unsorted.Add(generator.Next()%100);
            }
            Sort(unsorted);
        }
        static void Sort(List<int> unsorted)
        {
            for (int sorted = 1; sorted < unsorted.Count();i++)
            {
                int j = sorted;
                while (j>0 && unsorted[j] < unsorted[j - 1])
                {
                    int temp = unsorted[j-1];
                    unsorted[j - 1] = unsorted[j];
                    unsorted[j] = temp;
                    j--;
                }
            }
            unsorted.ForEach(Console.WriteLine);
            Console.ReadLine();
        }

    }
}