Question

Write a C program to create array, with random numbers and perform operations show below. Il Project 3 (53-20). 1 Projects CS5,00 This file contains the function Programcution Dagine and one include <timo // Defining some constants definer_SIZE 20 define LOVE LIMIT 1 eine UPR UNIT define TALSE eine Tut 1 wold randomizery (int[], int, Int, int) wold pinay in. St, Int); En find (nell), Intinde (lit) Float average it. ) Ist search in Sint) wold bubbleSort Intl. Int); Float Cit) printf("\nProject: int AS12E): srand(time(1) randay (amples, SIE, DER LIMIT, UPPER LERET) Fully w printf("Array Shoes, Array Elementi, ARRAY_SIZE) prima , , _512E): # Find , , an average and print the printf (", frax samples, ARRAY_SIZE) print it, tindring, ARTS12E) printf ("liverage-2r, warage samples, NY SIDE >> I Get a random warch for Int search entrand) (UPPER_L DRET - BERLINT +1) DER_LDRET; int searchIndex Sear(samples, ARRAY_SIZE, SearchE), 1+ and pre found at Inde, searchest, searches); printre not found, marchant); printing bubbleSort(mus, ARRAY_SIZE): printf("Weat - 16.2,wanaples, R_SIZE)); Forint - // Randomize array between lowland rod randomly int samples 1). Inte, int loin, int...) -11 65 / Print array elements from ved printint al ll. Int froint tot 72 EN 73 // Find and return element of the array sunt tindran ll. intr... 83 / Find and return element of the array 34 dinl. intr.. 93 Find and return element of the array 4 otweintill. intr... Find and returnement of the array intach (int il intre, int macht... 12 13 Sort the army using bubble Sort bubbleSortint all. Intra flutenint les inter 34 Page 1 of 5

I need to develop the 7 functions below into the main program that's given on top

Answer 1

CODE:

#include<bits/stdc++.h>
#define ARRAY_SIZE 20
#define LOWER_LIMIT 10
#define UPPER_LIMIT 99
#define FALSE 0
#define TRUE 1

using namespace std;

void randomizeArray(int samples[], int arraySize, int lowLim, int upLim){
for(int i=0; i<arraySize;i++){
samples[i] = (rand()%(upLim-lowLim+1))+lowLim; //generate random numbers
}
}
void printArray(int samples[], int fromElem, int toElem){
for(int i=fromElem; i<toElem;i++){
cout<<samples[i]<<" ";
}
}
int findMax(int samples[], int arraySize){
int maxElem = -9999999;
for(int i=0;i<arraySize;i++){
if(samples[i]>maxElem)
maxElem=samples[i];
}
return maxElem;
}
int findMin(int samples[], int arraySize){
int minElem = 9999999;
for(int i=0;i<arraySize;i++){
if(samples[i]<minElem)
minElem=samples[i];
}
return minElem;
}
float average(int samples[], int arraySize ){
int sum=0;
for(int i=0;i<arraySize;i++){
sum+=samples[i];
}
return sum/arraySize;
}
int seqSearch(int samples[], int arraySize, int searchElem){
for(int i=0;i<arraySize;i++){
if(samples[i]==searchElem)
return i;
}
return -1;
}
void bubbleSort(int samples[], int arraySize){
for(int i=0;i<arraySize;i++){
for(int j=0;j<arraySize-i-1;j++){
if(samples[j]>samples[j+1]){ //if current element is greater than next element
swap(samples[j], samples[j+1]); //swap samples
}
}
}
}
float median(int samples[], int arraySize){
if(arraySize%2 == 0){ //if no of elements is even
return ((samples[(arraySize/2)-1]+samples[(arraySize/2)])/2);
}else{ //if no of elements is odd
return samples[(arraySize/2)];
}
}

int main(){
int samples[ARRAY_SIZE];
srand(time(0));
randomizeArray(samples, ARRAY_SIZE, LOWER_LIMIT, UPPER_LIMIT);
printf("Array Size: %d, Array Elements: \n", ARRAY_SIZE);
printArray(samples, 0, ARRAY_SIZE);

printf("\nMaximum = %d", findMax(samples, ARRAY_SIZE));
printf("\nMinimum = %d", findMin(samples, ARRAY_SIZE));
printf("\nAverage = %f", average(samples, ARRAY_SIZE));

int searchElement = rand() % (UPPER_LIMIT-LOWER_LIMIT+1) + LOWER_LIMIT;
int searchIndex = seqSearch(samples, ARRAY_SIZE, searchElement);
if(searchIndex>=0)
printf("\nitem: %d was found at index %d\n", searchElement, searchIndex);
else
printf("\nitem: %d was not found\n", searchElement);

printf("\nSorting:\n");
bubbleSort(samples, ARRAY_SIZE);

printf("\nMedian = %6.2f\n", median(samples, ARRAY_SIZE));
return 0;
}

SNAPS:

1 #include<bits/stdc++.h> #define ARRAY_SIZE 20 #define LOWER_LIMIT 10 #define UPPER_LIMIT 99 #define FALSE O #define TRUE 1 using namespace std; 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 void randomizeArray(int samples[], int arraySize, int lowLim, int upLim){ for(int i=0; i<arraySize;i++){ samples[i] = (rand()%(upLim-lowLim+1))+lowLim; //generate random numbers } void printArray(int samples[], int fromElem, int toElem){ for(int i=from Elem; i<toElem;i++){ cout<<samples[i]<<""; } int findMax(int samples[], int arraySize){ int maxElem = -9999999; for(int i=0;i<arraySize;i++){ if(samples[i]>maxElem)

19 20 21 22 23 24 25 } int findMax(int samples[], int arraySize){ int maxElem = -9999999; for(int i=0;i<arraySize;i++){ if(samples[i]>maxElem) maxElem-samples[i]; } 26 return maxElem; 27 28 29 30 31 1 int findMin(int samples[], int array Size) { int minElem = 9999999; for(int i=0;i<arraySize;i++){ if(samples[i]<minElem) minElem-samples[i]; 32 } return min Elem: 33 34 35 36 37 38 39 40 41 float average(int samples[], int arraySize ){ int sum=0; for(int i=0;i<arraySize;i++){ sum+=samples[i]; } return sum/arraySize;

return sum/arraySize; int seqSearch(int samples[], int arraySize, int searchElem){ for(int i=0;i<arraySize;i++){ if(samples[i]==searchElem) return i; return -1; 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 void bubbleSort(int samples[], int array Size) { for(int i=0;i<arraySize;i++){ for(int j=0;j<arraySize-i-1;j++){ if(samples[j]>samples[j+1]){ //if current element is greater than next element swap(samples[j], samples[j+1]); //swap samples } } float median(int samples[], int arraySize){ if(arraySize%2 == 0){ //if no of elements is even return ((samples[(arraySize/2)-1]+samples[(arraySize/2)]}/2); }else{ //if no of elements is odd

randomizeArray(samples, ARRAY_SIZE, LOWER_LIMIT, UPPER_LIMIT); printf("Array Size: %d, Array Elements: \n", ARRAY_SIZE); printArray(samples, O, ARRAY_SIZE); printf("\nMaximum = %d", findMax(samples, ARRAY_SIZE)); printf("\n Minimum = %d", find Min(samples, ARRAY_SIZE)); printf("\nAverage = %f", average(samples, ARRAY_SIZE)); 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 int searchElement = rand() % (UPPER_LIMIT-LOWER_LIMIT+1) + LOWER_LIMIT; int searchindex = seqSearch(samples, ARRAY_SIZE, searchElement); if(searchIndex>=0) printf("\nitem: %d was found at index %d\n", searchElement, searchindex); else printf("\nitem: %d was not found\n", searchElement); printf("\nSorting: \n"); bubbleSort(samples, ARRAY_SIZE); printf("\nMedian = %6.21\n", median(samples, ARRAY_SIZE)); return 0; #define ARRAY_SIZE 20 }

OUTPUT:

Select C:\Users\achar OneDrive\Documents\C++ arrayOperations.exe Array Size: 20, Array Elements: 63 41 56 62 98 11 75 52 32 55 60 41 50 92 72 40 29 50 89 91 Maximum = 98 Minimum = 11 Average = 57.000000 item: 55 was found at index 9 Sorting: Median = 55.00