John N - Professional Profile

// [C#]
string[] unsorted = { "one", "two", "three", "four", "five", "six", "seven", "eight", "nine" };
int sz = 1;
while (sz < unsorted.Length)
{
	// Consider a pair of sub-lists.
	for (int n = 0; n < unsorted.Length / sz; n += 2)
	{
		/// For consideration: Are i1 and list1 in fact the same number? Whenever we
		/// increment list1, we also increment i1 and vice versa.
		int list1 = n*sz;
		//int list2 = (n+1)*sz;
		int i1 = list1;
		int i2 = (n+1)*sz;
		// Merge index is list1.
		while (i1 < i2 && i2 < (n+2)*sz && i2 < unsorted.Length)
		{
			if (unsorted[i1].CompareTo(unsorted[i2]) < 0)
			{
				/// Changed indices:
				/// First list (lost an item from the front)
				/// Merge location (always increments)
				i1++;
			}
			else
			{
				// Shuffle up.
				string temp = unsorted[i2];
				for (int i = i2; i > i1; i--)
				{
					unsorted[i] = unsorted[i-1];
				}
				unsorted[list1] = temp;
				/// Changed indices:
				/// First list (shuffled up by one)
				/// Second list (lost an item from the front)
				/// Merge location (always increments)
				i1++;
				i2++;
			}
			list1++;
		}
	}
	sz *= 2;
}