Question

create a file homework_part_1.c

a) Implement the function initialize_array that receives two parameters: an array of integers and the array size. Use a for loop and an if statement to put 0s in the odd positions of the array and 5s in the even positions. You must use pointers to work with the array. Hint: review pointers as parameters.

b) Implement the function print_array that receives as parameters an array of integers and the array size. Use a for statements to print all the elements in the array. You must use pointers to work with the array. Hint: review pointers as parameters.

c) Implement the function insertion_sort that receives as parameters an array of integers and the array size, and order the array’s elements in descending order. Implement Insertion Sort algorithm. It should be Insertion Sort, not Selection Sort, not Quick Sort, etc.

d) Implement the recursive function that calculates and returns the factorial of a number. The function receives the number (integer number) as parameter

Compile and run the code for homework_part_1.c

Answer 1

Given below is the code for the question.
Please do rate the answer if it was helpful. Thank you

homework_part_1.c
----------

#include <stdio.h>
void initialize_array(int *arr, int size);
void print_array(int *arr, int size);
void insertion_sort(int *arr, int size);
long factorial(int n);
int main(){
int arr1[10];
int arr2[5] = {5, 9, 3, 1, 6};

initialize_array(arr1, 10);
printf("Array arr1 after initialization: ");
print_array(arr1, 10);

printf("\nArray arr2 before insertion sort: ");
print_array(arr2, 5);

insertion_sort(arr2, 5);
printf("Array arr2 after insertion sort: ");
print_array(arr2, 5);

printf("\nFactorial of 5 is %ld\n", factorial(5));
return 0;
}

void initialize_array(int *arr, int size){
int i;
for(i = 0; i < size; i++){
if(i % 2 == 1) //odd position
*arr = 0;
else //even position
*arr = 5;

arr++;
}
}
void print_array(int *arr, int size){
int i;
for(i = 0; i < size; i++){
printf("%d ", *arr);
arr++;
}
printf("\n");
}

void insertion_sort(int *arr, int size){
int i, j;
int val;
for(i = 0; i < size; i++){
val = arr[i];
for(j = i - 1; j >= 0 && arr[j] > val; j--)
arr[j+1] = arr[j];

arr[j+1] = val;
}
}

long factorial(int n){
if(n <= 1)
return 1;
else
return n * factorial(n-1);
}

output
---
Array arr1 after initialization: 5 0 5 0 5 0 5 0 5 0

Array arr2 before insertion sort: 5 9 3 1 6
Array arr2 after insertion sort: 1 3 5 6 9

Factorial of 5 is 120