C# Online Compiler | .NET Fiddle

<no name> by Anonymous

using System;
					
public class Program
{
	public static void Main()
	{
		int[,] data = new int[4,4] { {1,2,3,4}, {5,6,7,8}, {9,1,2,3}, {4,5,6,7} };	
		//int[,] data = new int[4,3] { {1,2,3}, {5,6,7}, {9,1,2}, {4,5,6} };	
		//int[,] data = new int[3,3] { {1,2,3}, {5,6,7}, {9,1,2} };
		//int[,] data = new int[2,3] { {1,2,3}, {5,6,7} };
		
		
		Console.WriteLine("Initial: ");
		Print2DArray(data);
		
		var result = RemoveBorders(data);
		
		Console.WriteLine("\nResult: ");
		Print2DArray(result);
	}
	
	public static void Print2DArray<T>(T[,] data)
	{
		for(int i = 0; i<=data.GetUpperBound(0);i++)
		{
			for (int j = 0; j<=data.GetUpperBound(1);j++)
			{
				Console.Write(data[i,j]);
				Console.Write(' ');
			}
			Console.WriteLine();
		}
	}
	

	public static T[,] RemoveBorders<T>(T[,] source)
	{
		//index of last item, not number of items
		var ROW = source.GetUpperBound(0);
		if (ROW < 2) throw new ArgumentException("source array is not tall enough");

		var COL = source.GetUpperBound(1);          
		if (COL < 2) throw new ArgumentException("source array is not wide enough");

		var result = new T[ROW - 1, COL - 1];       
		for (int r = 1; r < ROW; r++)
		{
			for (int c = 1; c < COL; c++)
			{
				result[r-1, c-1] = source[r, c];    
			}
		}   
		return result;
	}
}

​x
 
using System;
                    
public class Program
{
    public static void Main()
    {
        int[,] data = new int[4,4] { {1,2,3,4}, {5,6,7,8}, {9,1,2,3}, {4,5,6,7} };  
        //int[,] data = new int[4,3] { {1,2,3}, {5,6,7}, {9,1,2}, {4,5,6} };    
        //int[,] data = new int[3,3] { {1,2,3}, {5,6,7}, {9,1,2} };
        //int[,] data = new int[2,3] { {1,2,3}, {5,6,7} };
        
        
        Console.WriteLine("Initial: ");
        Print2DArray(data);
        
        var result = RemoveBorders(data);
        
        Console.WriteLine("\nResult: ");
        Print2DArray(result);
    }
    
    public static void Print2DArray<T>(T[,] data)
    {
        for(int i = 0; i<=data.GetUpperBound(0);i++)
        {
            for (int j = 0; j<=data.GetUpperBound(1);j++)
            {
                Console.Write(data[i,j]);
                Console.Write(' ');
            }
            Console.WriteLine();
        }
    }
    
​
    public static T[,] RemoveBorders<T>(T[,] source)
    {
        //index of last item, not number of items
        var ROW = source.GetUpperBound(0);
        if (ROW < 2) throw new ArgumentException("source array is not tall enough");
​
        var COL = source.GetUpperBound(1);          
        if (COL < 2) throw new ArgumentException("source array is not wide enough");
​
        var result = new T[ROW - 1, COL - 1];       
        for (int r = 1; r < ROW; r++)
        {
            for (int c = 1; c < COL; c++)
            {
                result[r-1, c-1] = source[r, c];    
            }
        }   
        return result;
    }
}

abcd
=================
args from  to  =
args from  to  =
args from abcd to abcd = r1. idxStart=4 >= (s.Length - 1)=3

args from  to abcd =
args from abcd to  =
args from a to a =
args from a to b = r3. idxEnd=1 <= idxStart=1

args from a to c = b
args from a to d = bc
args from a to e =
args from e to e =
args from ab to a =
args from ab to b =
args from ab to c = r3. idxEnd=2 <= idxStart=2

args from ab to d = c
args from ab to a =
args from ab to b =
args from ab to c = r3. idxEnd=2 <= idxStart=2

args from ab to d = c
args from abc to a = r1. idxStart=3 >= (s.Length - 1)=3

args from abc to b = r1. idxStart=3 >= (s.Length - 1)=3

args from abc to c = r1. idxStart=3 >= (s.Length - 1)=3

args from abc to d = r1. idxStart=3 >= (s.Length - 1)=3

args from abcd to a = r1. idxStart=4 >= (s.Length - 1)=3

args from abcd to b = r1. idxStart=4 >= (s.Length - 1)=3

args from abcd to c = r1. idxStart=4 >= (s.Length - 1)=3

args from abcd to d = r1. idxStart=4 >= (s.Length - 1)=3

args from a to abc =
args from b to abc =
args from c to abc = r1. idxStart=3 >= (s.Length - 1)=3

args from d to abc = r1. idxStart=4 >= (s.Length - 1)=3

abcdabcd
=================
args from  to  =
args from  to  =
args from abcdabcd to abcdabcd = r1. idxStart=8 >= (s.Length - 1)=7

args from  to abcdabcd =
args from abcdabcd to  =
args from a to a = bcd
args from a to b = r3. idxEnd=1 <= idxStart=1

args from a to c = b
args from a to d = bc
args from a to e =
args from e to e =
args from ab to a = cd
args from ab to b = cda
args from ab to c = r3. idxEnd=2 <= idxStart=2

args from ab to d = c
args from ab to a = cd
args from ab to b = cda
args from ab to c = r3. idxEnd=2 <= idxStart=2

args from ab to d = c
args from abc to a = d
args from abc to b = da
args from abc to c = dab
args from abc to d = r3. idxEnd=3 <= idxStart=3

args from abcdabcd to a = r1. idxStart=8 >= (s.Length - 1)=7

args from abcdabcd to b = r1. idxStart=8 >= (s.Length - 1)=7

args from abcdabcd to c = r1. idxStart=8 >= (s.Length - 1)=7

args from abcdabcd to d = r1. idxStart=8 >= (s.Length - 1)=7

args from a to abc = bcd
args from b to abc = cd
args from c to abc = d
args from d to abc = r3. idxEnd=4 <= idxStart=4

args from abc to d = r3. idxEnd=3 <= idxStart=3

aaaa
=================
args from a to a = r3. idxEnd=1 <= idxStart=1

args from aa to a = r3. idxEnd=2 <= idxStart=2

args from aaa to a = r1. idxStart=3 >= (s.Length - 1)=3

args from aaaa to a = r1. idxStart=4 >= (s.Length - 1)=3

args from a to a = r3. idxEnd=1 <= idxStart=1

args from a to aa = r3. idxEnd=1 <= idxStart=1

args from a to aaa = r3. idxEnd=1 <= idxStart=1

args from a to aaaa =

aaaaaaaaaaaaaaaaaaaaaaaaaaaabbbb
=================
args from bbbb to aaaa = r1. idxStart=32 >= (s.Length - 1)=31

args from aaaaaaa to bb = aaaaaaaaaaaaaaaaaaaaa
in 27 ticks.

Cached Result
Last Run:	4:19:08 pm
Compile:	0.106s
Execute:	0s
Memory:	40kb
CPU:	0s

View IL Code