Question

C#

You must complete the Vector<T> implementation by providing the following functionality: void Insert(int index, T item) Inserts a new element into the data structure at the specified index. This will involve four parts (Note a part may be more than a single line of code): o If Count already equals Capacity (eg the currently allocated space is full), then the capacity of the Vector<T> is increased by reallocating the internal array, and the existing elements are copied to the new larger array ready for the new element to be added in the following steps. If index is equal to Count, item add the item to the end of the Vector<T>. If index is somewhere internal to the vector then starting at the end, shuffle each element along one until you reach the index location indicated and place the item in the vector at that point. if index is outside the range of the current Vector then this method should throw an IndexOutOfRange Exception. o O

public int IndexOf(T element)
{
for (var i = 0; i < Count; i++)
{
if (data[i].Equals(element)) return i;
}
return -1;
}

Answer 1

Program

using System;

//Vector class
class Vector<T>
{
    //private data members
    private T []data;
    private int Count;
    private int Capacity;
    
    //constructor
    public Vector(int n)
    {
        Capacity = n;
        data = new T[Capacity];
        Count = 0;
    }
    
    //IndexOf method
    public int IndexOf(T element)
    {
        for (var i = 0; i < Count; i++)
        {
            if (data[i].Equals(element)) return i;
        }
        return -1;
    }
    
    //insert method
    public void insert(int index, T item)
    {
        //check for invalid index
        if(index < 0 || index>Count)
            throw new IndexOutOfRangeException();
        
        //check Count equals to Capacity
        if(Count==Capacity)
        {
            //twice the Capacity
            Capacity = 2*Capacity;
            //create the new array
            T[]newData = new T[Capacity];
            //copy the existing array to new array
            for(var i=0; i<Count; i++)
            {
                newData[i] = data[i];
            }
            data = newData;
        }
        //check index equals to Count then insert at the end
        if(index==Count)
        {
            data[Count] = item;
        }
        //insert somewhere in the middle
        else   
        {
            for(var i=Count-1; i>=index; i--)
            {
                data[i+1] = data[i];
            }
            data[index] = item;
        }
        //increse the Count
        Count = Count + 1;
    }
    
    //Remove method
    public bool Remove(T item)
    {
        //get the index
        int i = IndexOf(item);
        //check for invalid index and
        //return false for invalid index
        if(i==-1) return false;
        //remove for valid index
        RemoveAt(i);
        //return true for valid index
        return true;
    }
    
    //RemoveAt method
    public void RemoveAt(int index)
    {
        //check for invalid index
        if(index < 0 || index>Count)
            throw new IndexOutOfRangeException();
        
        //remove the item from array
        for(var i=index; i<Count-1; i++)
        {
            data[i] = data[i+1];
        }
        //decrease the Count
        Count = Count - 1;
    }
    
    public void print()
    {
        for(var i=0; i<Count; i++)
        {
            Console.Write(data[i] + " ");
        }
        Console.WriteLine();
    }
}


class Program
{
    public static void Main(string[] args)
    {
        Vector<int> vec = new Vector<int>(3);
        
        vec.insert(0, 10);
        vec.insert(1, 20);
        vec.insert(2, 30);
        vec.insert(3, 40);
        vec.insert(4, 50);
        vec.print();
        vec.RemoveAt(3);
        vec.print();
        
            
        Console.Write("Press any key to continue . . . ");
        Console.ReadKey(true);
    }
}

Output:

10 20 30 40 50
10 20 30 50
Press any key to continue . . .

Note:  Whether you face any problem or need any modification then share with me in the comment section, I'll happy to help you.