This project implements a matrix filling algorithm that creates a Vertical Serpentine pattern starting from the Bottom-Right corner.

The algorithm fills the matrix column by column, moving from Right to Left:

1. Col $N-1$ (Rightmost): Fills Upwards ($\uparrow$)
2. Col $N-2$: Fills Downwards ($\downarrow$)
3. Col $N-3$: Fills Upwards ($\uparrow$) ...and so on.

Matches the 3rd pattern in the problem set:

• 1 -> 3: Starts at [2][2], goes Up.
• 4 -> 6: Moves to Col 1, goes Down.
• 7 -> 9: Moves to Col 0, goes Up.

This repository demonstrates conditional loops and multidimensional array traversal in C.