$/*$

$*$ dataStructure.c

$*$

$*$ Provides a bound$-$checked data structure made of an array of integers

$*$ in which duplicated elements are allowed.

$*$

$*$ The interface of this data structure includes several utility

$*$ functions that operate on this array of integers as well as

$*$ file i$/$o functions: saving into and loading from json files.

$*$

$*$ Do not change the dataStructure.h file.

$*$

$*$ Author: RV $+$ AL

$*$ Modified Date: July $2024$

$*/$

#include $//$ for malloc$()$ and for rand$()$

#include $//$ for file i$/$o calls

#include $//$ for time$()$

#include $//$ for strlen$()$

#include "dataStructure.h$"$

$/*$

$*$ Description: Creates a new intArray$\_$t data structure

$*$ with initial array size "size".

$*$ If successful $($i$.$e$.$ memory allocation succeeds$),$

$*$ returns a pointer to a newly$-$allocated intArray$\_$t$.$

$*$ If unsuccessful, returns a NULL pointer.

$*$ Time Efficiency: O$(1)$

$*/$

intArray$\_$t $*$ intArray$\_$create$($ unsigned int size $)\{$

$//$ Allocate memory on the heap for intArray$\_$t struct

intArray$\_$t $*$ ia $=$ malloc$($ sizeof$($ intArray$\_$t $))$;

if $($ ia $!=$ NULL $)\{$

$//$ Set its field "size"

ia$->$size $=$ size;

$//$ Allocate memory on the heap for array

ia$->$data $=$ malloc$($ size $*$ sizeof$($int$))$;

if $($ ia$->$data $==$ NULL $)\{$

free$($ ia $)$;

ia $=$ NULL;

$\}$

else

$//$ Set its field "elementCount" to zero $->$ empty array

ia$->$elementCount $=0$;

$\}$

return ia;

$\}$

$/*$

$*$ Description: Frees all memory allocated for $"$ia$".$

$*$ If the pointer $"$ia$"$ is NULL, it does nothing.

$*$ If the pointer $"$ia$->$data" is NULL, it does not

$*$ attempt to free it$.$ Returns INTARR$\_$OK$.$

$*$ Time Efficiency: O$(1)$

$*/$

intArrayResult$\_$t intArray$\_$destroy$($ intArray$\_$t $*$ ia $)\{$

$//$ If heap memory has been allocated for intArray$\_$t struct $...$

if $($ ia $!=$ NULL $)\{$

$//$ If heap memory has been allocated for array $...$

if $($ ia$->$data $!=$ NULL $)\{$

$//...$ then free it

free$($ ia$->$data $)$;

ia$->$data $=$ NULL;

$\}$

$//...$ then free it$.$

free$($ ia $)$;

ia $=$ NULL;

$\}$

return INTARR$\_$OK;

$\}$

$/*$ Description: Appends "newElement" and returns INTARR$\_$OK$.$

$*$ If "newElement" cannot be appended, leaves the

$*$ data structure unmodified and returns INTARR$\_$ERROR.

$*$ If $"$ia$"$ is NULL, returns INTARR$\_$BADPARAM.

$*$ Time efficiency: O$(1)$

$*/$

intArrayResult$\_$t intArray$\_$append$($ intArray$\_$t $*$ ia$,$ int newElement $)\{$

$//$ Function Stub

$//$ This stub is to be removed when you have successfully implemented this function.

printf$($ "Calling intArray$\_$append$(...)$ with the parameter newElement $->\%$d$.$

$",$ newElement $)$;

return INTARR$\_$OK; $//$ You are free to modify this return statement.

$\}$

$/*$ Description: Removes the element at "indexToBeRemoved" in the data structure

$*$ and returns INTARR$\_$OK$.$ If the data structure was initially sorted,

$*$ it does not remain sorted after removing the element at "indexToBeRemoved".

$*$ If $"$ia$"$ is NULL or "indexToBeRemoved" is out of bounds, returns INTARR$\_$BADPARAM.

$*$ Time efficiency: O$(1)$

$*/$

intArrayResult$\_$t intArray$\_$remove$($ intArray$\_$t $*$ ia$,$ unsigned int indexToBeRemoved $)\{$

$//$ Function Stub

$//$ This stub is to be removed when you have successfully implemented this function.

printf$($ "Calling intArray$\_$remove$(...)$ with the parameter indexToBeRemoved $->\%$u$.$

$",$ indexToBeRemoved $)$;

return INTARR$\_$OK; $//$ You are free to modify this return statement.

$\}$

$/*$ Description: Modifies