Question

c++. please show screenshots of output

This project will continue to familiarize the student with using arrays. Store all the function proto-types in project11_funch and store all the functions in project11_func.cpp. Make sure you have proper header comments in each.h,.cpp file. When you run your program, your sample output should show your name. Your report should include the following: 1) project11_func.h 2) project11_func.cpp 3) project11.cpp 4) sample output Write the following functions: a) void fill_array_with_random_nums(int array(), int N): Fill array with random numbers. You generate N random numbers. Each random number is to be between 0 to 3N (inclusive) b) void print_array(int array(), int N, int M): It prints array contents M per line. The number of elements in the array is N. This is similar to that of project 10. c) void insertion_sortint array(), int N): Use the insertion sort discussed in class to create this function. This function accepts an array. It sorts its content in the ascending order. d) int linear_search(int array(), int n, int element): This function searches the array to see if the element is in the array. If it is found then it returns the index where the element is. If the element is not in the array then it returns - 1. e) void print_search_resultint_array[], int N). For i=0 to 3N, use linear_search() in part d, to search the array for 1, it is in the array then print'+' to the screen otherwise print '.' to the screen. At the end of last element search, print"\n". Write a program to perform the following tasks 1) define array p to hold maximum of 100 integers. 2) Ask user to enter a value for N and M. N to be between 1 to 100. 3) Call fill array_with_random_numbers(p, N) to fill the array p with N random numbers. 4) Call print_array(p, N, M) to print the array p contents. 5) Call insertion_sort(p, N) to sort array p contents. 6) Print array p contents. 7) call print_search_result(p,N) to print the search results.

Answer 1

Enter value in between 1 and 100: 10 Enter a value: 3 13 16 27 25 23 25 16 12 9 1 1 9 12 13 16 16 23 25 25 27 - + - - - - - - - + - - + + - - + - - - - - + - + - + - - - nikhil@nikhil-Vostro-15-3568:-/Desktop/CODE$ I

project11.cpp

#include "project11_func.cpp"

int main(int argc, char const *argv[])
{
int p[100];
int N, M;
cout<<"Enter value in between 1 and 100: ";
cin>>N;
cout<<"Enter a value: ";
cin>>M;
fill_array(p,N);
print_array(p,N,M);
insertion_sort(p,N);
for(int i=0;i<N;i++)
cout<<p[i]<<" ";
cout<<endl;
print_search_result(p,N);
return 0;
}

WNE #include "projectll_fund.cpp" int main(int argc, char const *argv[]) int p[100); int N, M; cout<<"Enter value in between 1 and 100: "; cin>>N; cout<<"Enter a value: "; cin>>M; fill_array(p.N); print array(p,N,M); insertion sort(p,N); for(int i=0;i<N;i++) cout<<P[i]<<" "; cout<<endl; print search_result(p,N); return ;

project11_func.cpp

#include "project11_func.h"
#include <iostream>
using namespace std;

void fill_array(int array[], int N){
for(int i=0;i<N;i++){
array[i] = rand() % (3*N);
}
}

void print_array(int array[], int N, int M){
int b=0;
for(int i=0;i<N;i++){
if(b==M){
cout<<endl;
b=0;
}
cout<<array[i]<<" ";
b++;
}
cout<<endl;
}

void insertion_sort(int array[], int N){
int i, key, j;
for (i = 1; i < N; i++)
{
key = array[i];
j = i - 1;
while (j >= 0 && array[j] > key)
{
array[j + 1] = array[j];
j = j - 1;
}
array[j + 1] = key;
}
}

int linear_search(int array[], int N, int element){
for(int i=0; i<N;i++){
if(array[i] == element)
return i;
}
return -1;
}

void print_search_result(int array[], int N){
for(int i=0; i<=3*N;i++){
if(linear_search(array,N,i)==-1)
cout<<"-";
else
cout<<"+";
}
cout<<endl;
}

#include "projectll func.h" #include <iostream> using namespace std; void fill array(int array[], int N) { for(int i=0;i<N;i++) { array[i] = rand() $ (3N); void print array(int array[], int n, int M){ int b=0; for(int i=0;i<N;i++){ if(b=M){ cout<<endl; b= ; cout<<array[i]<<" "; b++; cout<<endl; void insertion sort(int array(), int N) { int i, key, ji for (i = 1; i < N; i++) key = array[i]; j - i - 1; while (j >= 0 & array[i] > key) array(j + 1] = array[i]; j = j - 1; array( + 1] = key: int linear_search(int array[], int n, int element) { for(int i=0; i<N;i++){ if(array[i] =element) return i; return -1;

if(array[i] == element) return i; return -1; void print_search_result(int array[], int N) { for(int i=0; i =3 N;i++){ if(linear search(array,N, i)==-1) cout<<"."; else cout<<"+"; cout<<endl; 55 }

project11_func.h

void fill_array(int array[], int N);
void print_array(int array[], int N, int M);
void insertion_sort(int array[], int N);
int linear_search(int array[], int N, int element);
void print_search_result(int array[], int N);

2 void fill array(int array[], int N); void print array(int array[], int n, int M); void insertion sort(int array[], int N); int linear search(int array[], int n, int element); void print search_result(int array[], int N); 5