can I get help with this code?

int insertionsort (int * const data, int size ); sorts the array using the insertion sort algorithm Caution: there are a lot of programs out there on the web that claim to be insertion sort written in c. The class syllabus prohibits copying code from web sites. A grade of zero will be assigned for this assignment if the TA or instructor sees evidence that you have copied code. You cannot use the bracket [ ] notation to access array elements. You have to use pointer/offset notation. The return value is a count of the number of comparisons that are made. Specifically, you should count the number of times that the program executes an if statement that compares the values of two array elements. void swap( int * numi, int * num2); Exchanges the contents of the two memory locations. void fillArray ( int * const data, int size, int min, int max ); Fills the array elements with integers from min to max (inclusive). You cannot use the bracket [ ] notation to access array elements. You have to use pointer/offset notation. void neat Print ( int * const data, int size, int numberline, int fieldsize ); Prints the array elements in nice, neat columns using the parameters numberline and fieldsize to control the layout. You cannot use the bracket [ ] notation to access array elements. You have to use pointer/offset notation. int insertionsort (int * const data, int size ); sorts the array using the insertion sort algorithm Caution: there are a lot of programs out there on the web that claim to be insertion sort written in c. The class syllabus prohibits copying code from web sites. A grade of zero will be assigned for this assignment if the TA or instructor sees evidence that you have copied code. You cannot use the bracket [ ] notation to access array elements. You have to use pointer/offset notation. The return value is a count of the number of comparisons that are made. Specifically, you should count the number of times that the program executes an if statement that compares the values of two array elements. void swap( int * numi, int * num2); Exchanges the contents of the two memory locations. void fillArray ( int * const data, int size, int min, int max ); Fills the array elements with integers from min to max (inclusive). You cannot use the bracket [ ] notation to access array elements. You have to use pointer/offset notation. void neat Print ( int * const data, int size, int numberline, int fieldsize ); Prints the array elements in nice, neat columns using the parameters numberline and fieldsize to control the layout. You cannot use the bracket [ ] notation to access array elements. You have to use pointer/offset notation