Description Write a program that asks the user for an integer value greater than zero. It will verify that the user has entered a valid value and then try to allocate enough space using malloc for an array of n elements where n is the integer they entered in the first step. Your program should make sure that the allocation worked and then call a function named fillArray that uses a for loop and the square brackets operator to fill the array with the first n odd numbers. For example, the variable that is zero elements away from the base address should get the value 1, the value that is 1 element away from the base address should get the value 3, and so on (see the screen shot below). Afterwards, call another function called printDown that uses another for loop and the square brackets operator to print them in reverse order separated by new lines. Print a line that has 3 asterisks (**") in it by itself. Finally, call another function called printUp that uses another for loop that prints all of the array elements in order but without using the square bracket operator. To do this, you will need to use only the dereference operator and pointer arithmetic (i.e., increment or decrement the pointer). Don't forget to free the memory before the program ends. Your program output should look like the following (please use the same working and format)
Description
Write a program that asks the user for an integer value greater than zero. It will verify that the user has entered a valid value and then try to allocate enough space using malloc for an array of n elements where n is the integer they entered in the first step.
Your program should make sure that the allocation worked and then call a function named fillArray that uses a for loop and the square brackets operator to fill the array with the first n odd numbers. For example, the variable that is zero elements away from the base address should
get the value 1, the value that is 1 element away from the base address should get the value 3, and so on (see the screen shot below). Afterwards, call another function called printDown that uses another for loop and the square brackets operator to print them in reverse order separated by
new lines.
Print a line that has 3 asterisks (''*,,) in it by itself. Finally, call another function called printUp that uses another for loop that prints all of the array elements in order but without using the square bracket operator. To do this, you will need to use only the dereference operator and pointer arithmetic (i.e., increment or decrement the pointer).
Don't forget to free the memory before the program ends.
Your program output should look like the following (please use the same working and format)
![Description
Write a program that asks the user for an integer value greater than zero. It will verify that the
user has entered a valid value and then try to allocate enough space using malloc for an array of n
elements where n is the integer they entered in the first step.
Your program should make sure that the allocation worked and then call a function named
fillArray that uses a for loop and the square brackets operator to fill the array with the first
n odd numbers. For example, the variable that is zero elements away from the base address should
get the value 1, the value that is 1 element away from the base address should get the value 3, and
so on (see the screen shot below). Afterwards, call another function called printDown that uses
another for loop and the square brackets operator to print them in reverse order separated by
new lines.
Print a line that has 3 asterisks (*") in it by itself. Finally, call another function called printUp
that uses another for loop that prints all of the array elements in order but without using the
square bracket operator. To do this, you will need to use only the dereference operator and
pointer arithmetic (i.e., increment or decrement the pointer).
Don't forget to free the memory before the program ends.
Your program output should look like the following (please use the same working and format)](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F9640c6b4-cf54-4438-9015-6923eddc9a17%2F6d8735cf-2075-4f6a-8b0f-d1760bd59461%2Febjzgab_processed.png&w=3840&q=75)
![> run
Please enter the number of elements of your dynamic array:
10
Element at index 9 : 19
Element at index 8
: 17
Element at index 7 : 15
Element at index 6: 13
Element at index 5 :
11
Element at index 4 :
9
Element at index 3
: 7
Element at index 2: 5
Element at index 1 : 3
Element at index 0 : 1
***
Element at index 0: 1
Element at index 1
: 3
Element at index 2 : 5](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F9640c6b4-cf54-4438-9015-6923eddc9a17%2F6d8735cf-2075-4f6a-8b0f-d1760bd59461%2Fql23s3_processed.png&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)