simple sorted list implementation using insert sort

SortedList.cs

// simple sorted list implementation using insert sort
// maintainer hugoyu
 
using System.Collections.Generic;

namespace Util
{
	public class SortedList<T>
	{
	    public SortedList(IComparer<T> comparer = null)
	    {
	        m_comparer = comparer;
	    }
	
	    public int Count
	    {
	        get
	        {
	            return m_elementList.Count;
	        }
	    }
	
	    public T this[int index]
	    {
	        get
	        {
	            return m_elementList[index];
	        }
	    }
	
	    public bool Contains(T item)
	    {
	        return m_elementList.BinarySearch(item, m_comparer) >= 0;
	    }
	
	    public void Add(T item)
	    {
	        var index = m_elementList.BinarySearch(item, m_comparer);
	        if (index < 0)
	        {
	            m_elementList.Insert(~index, item);
	        }
	        else
	        {
	        	m_elementList.Insert(index, item);
	        }
	    }
	
	    public bool Remove(T item)
	    {
	        var index = m_elementList.BinarySearch(item, m_comparer);
	        if (index >= 0)
	        {
	            m_elementList.RemoveAt(index);
	            return true;
	        }
	
	        return false;
	    }
	
	    public void Clear()
	    {
	        m_elementList.Clear();
	    }
	
	    IComparer<T> m_comparer;
	    List<T> m_elementList = new List<T>();
	}
}