using System;
using System.Diagnostics;

namespace QuickSort
{
    public class Program
    {
        public static void Main()
        {
            const int ARRAY_SIZE = 1000 * 1000;

            var watch = new Stopwatch();
            for (var i = 0; i < 5; i++)
            {
                GC.Collect();
                watch.Restart();

                var vals = new TestStruct[ARRAY_SIZE];
                for (int j = 0; j < vals.Length; j++)
                {
                    vals[j] = TestStruct.Create();
                }

                watch.Stop();
                Console.WriteLine($"Total: {watch.ElapsedMilliseconds} ms");
            }
            Console.WriteLine($"GC: {GC.CollectionCount(0)} {GC.CollectionCount(1)} {GC.CollectionCount(2)}");
            Console.ReadLine();
        }
    }

    internal unsafe struct TestStruct
    {
        public string id;
        public string value;
        private static readonly Random random = new Random();

        public static TestStruct Create()
        {
            TestStruct item;
            item.id = GenerateRandomNumber();
            item.value = GenerateRandomNumber();
            return item;
        }

        public override string ToString() => id;

        private static string GenerateRandomNumber()
        {
            int num = random.Next(100_000_000);
            var result = new string('0', 10);
            fixed (char* p = result)
            {
                *(p + 2) = (char)('0' + num % 10); num /= 10;
                *(p + 3) = (char)('0' + num % 10); num /= 10;
                *(p + 4) = (char)('0' + num % 10); num /= 10;
                *(p + 5) = (char)('0' + num % 10); num /= 10;
                *(p + 6) = (char)('0' + num % 10); num /= 10;
                *(p + 7) = (char)('0' + num % 10); num /= 10;
                *(p + 8) = (char)('0' + num % 10); num /= 10;
                *(p + 9) = (char)('0' + num);
            }
            return result;
        }
    }
}