Store the representation in a sequential Storage Structure and implement the C # Algorithm #

Code
Using System;
Using System. Collections. Generic;
Using System. Linq;
Using System. Text;
Using System. Collections;
Using System. Collections. Specialized;
Using System. Threading;

Using System. Reflection;
Using System. Data;

Namespace TestArray
{
Class Program
{

// Test the sequential Storage Class
Static void Main (string [] args)
{
String s1 = "red ";
String S2 = "blue ";
String S3 = "yellow ";

Seqstructure <string> S = new seqstructure <string> (3 );
S. adddata (S1 );
S. adddata (S2 );
S. adddata (S3 );
S. displaydata ();

Console. Readline ();
}
}

/// <Summary>
/// Data element, relational storage representation and Algorithm Implementation
/// </Summary>
/// <Typeparam name = "T"> </typeparam>
Class seqstructure <t>
{
T [] data; // t represents the storage representation of data elements, and arrays represent the sequential storage of data elements
Int I;

Public seqstructure (INT size)
{
Data = new T [size];
}

Public void AddData (T var)
{
Data [I ++] = var;
}

Public void DisplayData ()
{
For (int j = 0; j <data. Length; j ++)
{
Console. Write (data [j] + "");
}
}
}

}