$1.$ Traversing a $2$D Array in a Snake Pattern Using Pointers

Problem Statement:

Write a C program to traverse a $3$x$3$ matrix and print all its elements in a "snake" order using a pointer. The traversal order should follow this sequence:

a$[0][0],$ a$[0][1],$ a$[0][2],$ a$[1][2],$ a$[1][1],$ a$[1][0],$ a$[2][0],$ a$[2][1],$ a$[2][2]$

Requirements:

Use a pointer to iterate through the matrix elements.

Do not use any predefined array of offsets; calculate the memory locations dynamically.

Assume the matrix is initialized as follows:

int a$[3][3]=\{$

$\{1,2,3\},$

$\{4,5,6\},$

$\{7,8,9\}$

$\}$;

Your program should print the elements in the specified "snake" order. Not: must use only $1$ for loop.

Example Output:

$123654789$

Traversing a $2$D Array in a Snake Pattern Using Pointers

Problem Statement:

Write a C program to traverse a $3$x$3$ matrix and print all its elements in a "snake" order using a pointer. The traversal order should follow this sequence:

a$[0][0],$ a$[0][1],$ a$[0][2],$ a$[1][2],$ a$[1][1],$ a$[1][0],$ a$[2][0],$ a$[2][1],$ a$[2][2]$

Requirements:

Use a pointer to iterate through the matrix elements.

Do not use any predefined array of offsets; calculate the memory locations dynamically.

Assume the matrix is initialized as follows:

int a$[3][3]=\{$

$\{1,2,3\},$

$\{4,5,6\},$

$\{7,8,9\}$

$\}$;

Your program should print the elements in the specified "snake" order.

Example Output:

$123654789$

#include

int main$()\{$

$//$ Declare and initialize the $3$x$3$ array

int a$[3][3]=\{$

$\{1,2,3\},$

$\{4,5,6\},$

$\{7,8,9\}$

$\}$;

$//$ Use a pointer to traverse the array

int $*$ptr $=$ &a$[0][0]$;

$//$ Define the "snake" order as offsets

int offsets$[]=\{0,1,2,5,4,3,6,7,8\}$;

int size $=$ sizeof$($offsets$)/$ sizeof$($offsets$[0])$;

printf$("$Snake order traversal:

$")$;

for $($int i $=0$; i $<$ size; i$++)\{$

$//$ Calculate the pointer offset and print the value

printf$("\%$d $",*($ptr $+$ offsets$[$i$]))$;

$\}$

printf$("$

$")$;

return $0$;

$\}$

$********$

#include

int main$()\{$

$//$ Declare and initialize the $3$x$3$ array

int a$[3][3]=\{$

$\{1,2,3\},$

$\{4,5,6\},$

$\{7,8,9\}$

$\}$;

$//$ Pointer to the start of the array

int $*$ptr $=$ &a$[0][0]$;

int rows $=3,$ cols $=3$;

printf$("$Snake order traversal:

$")$;

$//$ Iterate through the rows and columns in snake order

for $($int i $=0$; i $<$ rows; i$++)\{$

if $($i $\%2==0)\{$

$//$ For even rows, go left to right

for $($int j $=0$; j $<$ cols; j$++)\{$

printf$("\%$d $",*($ptr $+$ i $*$ cols $+$ j$))$;

$\}$

$\}$ else $\{$

$//$ For odd rows, go right to left

for $($int j $=$ cols $-1$; j $>=0$; j$--)\{$

printf$("\%$d $",*($ptr $+$ i $*$ cols $+$ j$))$;

$\}$

$\}$

$\}$

printf$("$

$")$;

return $0$;

$\}$