Search sorted List for an element with default comparer and returns the zero-based index of the element in CSharp

using System;// w  ww  .ja v  a 2 s. c  om
using System.Collections.Generic;

public class Example
{
    public static void Main()
    {
        List<string> myData = new List<string>();

        myData.Add("B");
        myData.Add("C");
        myData.Add("D");

        foreach(string myD in myData)
        {
            Console.WriteLine(myD);
        }
        myData.Sort();

        foreach(string myD in myData)
        {
            Console.WriteLine(myD);
        }

        int index = myData.BinarySearch("newValue");
        if (index < 0)
        {
            myData.Insert(~index, "newValue");
        }
        
        
        foreach(string myD in myData)
        {
            Console.WriteLine(myD);
        }

    }
}