C#

<br />
Array.Copy(theArray, removeAt+1, theArray, removeAt, theArray.Count-removeAt+1);<br />

      <br />
//<br />
// Create an array of strings...<br />
//<br />
string[] theArray = "This will become an array of strings".Split(new char[] {' '});<br />
//<br />
// We now have an array of strings containing: <br />
// "This", "will", "become", "an", "array", "of", "strings"<br />
//<br />
// If you want to <remove> the second element AND shrink the array then you need<br />
// to create a new array of shorter length and copy the elements from the original<br />
// to the new array...<br />
//<br />
int removeIndex = 1; // zero based array indexing!<br />
string[] newArray = new string[theArray.Length-1];<br />
//<br />
// This for-loop copies all elements before and after the element that<br />
// you want to remove. It would be SLOW for long arrays!<br />
//<br />
for(int i=0; i < theArray.Length; ++i)<br />
{<br />
  if (i < removeIndex)<br />
    newArray[i] = theArray[i];<br />
  else if (i > removeIndex)<br />
    newArray[i-1] = theArray[i];<br />
}      <br />
//<br />
// newArray constains an array of strings:<br />
// "This", "become", "an", "array", "of", "strings"<br />
//<br />
// For long arrays we can achieve this much quicker by using block-copy:<br />
//<br />
string[] anotherNewArray = new string[theArray.Length-1];<br />
if (removeIndex == 0)<br />
{<br />
  // Special case when removing the first element.<br />
  Array.Copy(theArray, 1, anotherNewArray, 0, anotherNewArray.Length);<br />
}<br />
else if (removeIndex == theArray.Length-1)<br />
{<br />
  // Special case when removing the least element.<br />
  Array.Copy(theArray, 0, anotherNewArray, 0, anotherNewArray.Length);<br />
}<br />
else<br />
{<br />
  // Most cases will require two block copies, before and after removed elm.<br />
  Array.Copy(theArray, 0, anotherNewArray, 0, removeIndex);<br />
  Array.Copy(theArray, removeIndex+1, anotherNewArray, removeIndex, <br />
    theArray.Length-removeIndex-1<br />
    );<br />
}      <br />