algo/csharp/05-array/Array.cs

using System;

public sealed class Array<T>
{
    private T[] _data;
    private int _capacity;
    private int _length;

    public Array (int capacity)
    {
        _data = new T[capacity];
        _capacity = capacity;
        _length = 0;
    }

    // length of list
    public int Length => _length;

    // insert a new element at specified position (position start from 1)
    public void Insert (int position, T newElem)
    {
        if (_length == _capacity)
        {
            throw new OutOfMemoryException ("List has no more space");
        }

        if (position < 1 || position > _length + 1)
        {
            throw new IndexOutOfRangeException ("Position was outside the bounds of the list");
        }

        // to loop array from last position until finding the target position
        if (position <= _length)
        {
            for (int k = _length - 1; k >= position - 1; k--)
            {
                _data[k + 1] = _data[k];

            }
        }
        _data[position - 1] = newElem;

        _length++;
    }

    // get an element  (position start from 1)
    public T Find (int position)
    {
        if (position < 0 || position > _length)
        {
            throw new IndexOutOfRangeException ("Position was outside the bounds of the list");
        }
        return _data[position - 1];
    }

    // search the element which matches specified element and return its index (index start from 0)
    public int IndexOf (T elem)
    {
        if (_length == 0) return -1;
        if (_data[0].Equals (elem)) return 0;
        if (_data[_length - 1].Equals (elem)) return _length - 1;

        int start = 0;
        while (start < _length - 1)
        {
            if (_data[start].Equals (elem)) return start;
            start++;
            continue;
        }

        return -1;
    }

    // delete an element which is on the specified position (position start from 1)
    public T Delete (int position)
    {
        if (position < 1 || position > _length)
        {
            throw new IndexOutOfRangeException ("Position must be in the bound of list");
        }

        var elem = _data[position - 1];
        for (int k = position; k < _length; k++)
        {
            _data[k - 1] = _data[k];
        }

        _length--;

        return elem;
    }

    // clear list
    public void Clear ()
    {
        _data = new T[_capacity];
        _length = 0;
    }
}