using System;
class TraverseBothSides
{
/*
Demonstration of traversing an array from both ends at the same time
in idiomatic C#.
We use the classic "two‑index" technique:
- left starts at index 0
- right starts at index array.Length - 1
Both move toward the center.
This approach is efficient (O(n)), simple, and widely used in
algorithms such as palindrome checks, partitioning, and pair searching.
*/
// ------------------------------------------------------------
// Method: TraverseFromBothSides
// Purpose: Traverse an array from both ends simultaneously.
// ------------------------------------------------------------
static void TraverseFromBothSides(int[] arr)
{
int left = 0;
int right = arr.Length - 1;
// Move inward until the indices cross
while (left <= right) {
Console.WriteLine($"Left: {arr[left]}, Right: {arr[right]}");
left++;
right--;
}
}
// ------------------------------------------------------------
// Main program
// ------------------------------------------------------------
static void Main()
{
int[] array = {10, 20, 30, 40, 50, 60, 70, 80, 90};
Console.WriteLine("Traversing from both sides:");
TraverseFromBothSides(array);
}
}
/*
run:
Traversing from both sides:
Left: 10, Right: 90
Left: 20, Right: 80
Left: 30, Right: 70
Left: 40, Right: 60
Left: 50, Right: 50
*/
