Write a C program and the name of the function is bigv and the argument declared is size, where size indicates the size of the pattern that the function will print. Specifically, this function is called with 6 as the argument for size, then it should print the following:
Write a C program and the name of the function is bigv and the argument declared is size, where size indicates the size of the pattern that the function will print. Specifically, this function is called with 6 as the argument for size, then it should print the following:
\ /
\ /
\ /
\ /
\ /
\ /
Q2.
|
Consider an array of integers of size n, whose values are set randomly using the rand () function. Write a C code that sorts the elements from the smallest to the largest value. One will proceed as follow: 1) Search for the minimum of the elements in the index positions 0 to n-1. Swap the minimum and first element. 2) Search for the minimum of the elements in the index 1 to n-1. Swap the minimum and second element and so on. 3) Repeat until the array is sorted. |
Q3.
Write a function that searches for a value in an array. The function will take three arguments:
1) An integer value that is greater than 0 and indicates the size of the array,
2) An integer array of that size, and
3) An integer value that we would like to search. The function should return an integer value. It should return -1 if the value that is being searched is not in the array. Otherwise, it should return the position of the value in the array (return 0 for the first position). Assume that there are no duplicates in the list - every item is unique.
Step by step
Solved in 2 steps with 1 images
