1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85
|
#include <iostream.h>
#include <stdlib.h>
void fillArray(int* ar, int size, int inc);
void printArray(int* ar, int size);
void mergeArrays(int a1[], int size1, int a2[], int size2, int* a3);
void shuffle(int* ar, int size);
int indexOfMinimum(int ar[], int size);
void reverseArray(int* ar, int size);
int main() {
int ar1[5], ar2[4], ar3[9];
int inc1, inc2;
cout << "Enter the first value and increment for ar1: ";
cin >> ar1[0] >> inc1;
cout << "Enter the first value and increment for ar2: ";
cin >> ar2[0] >> inc2;
fillArray(ar1, sizeof(ar1)/4, inc1);
fillArray(ar2, sizeof(ar2)/4, inc2);
cout << endl;
cout << "ar1:" << endl;
printArray(ar1, sizeof(ar1)/4);
cout << endl << endl;
cout << "ar2:" << endl;
printArray(ar2, sizeof(ar2)/4);
cout << endl << endl;
mergeArrays(ar1, sizeof(ar1)/4, ar2, sizeof(ar2)/4, ar3);
cout << "ar3:" << endl;
printArray(ar3, sizeof(ar3)/4);
cout << endl << endl;
shuffle(ar3, sizeof(ar3)/4);
cout << "ar3 after shuffle:" << endl;
printArray(ar3, sizeof(ar3)/4);
cout << endl << endl;
cout << "Index of the minimum element is: " << indexOfMinimum(ar3, sizeof(ar3)/4) << endl;
cout << endl;
cout << "ar3 after reverse: " << endl;
reverseArray(ar3, sizeof(ar3)/4);
printArray(ar3, sizeof(ar3)/4);
cout << endl << endl;
return 0;
}
void fillArray(int* ar, int size, int inc) {
for (int i=1;i<size;i++) ar[i]=ar[i-1]+inc;
}
void printArray(int ar[], int size) {
for (int i=0;i<size;i++) cout << ar[i] << " ";
}
void mergeArrays(int a1[], int size1, int a2[], int size2, int* a3) {
for (int i=0;i<size1;i++) a3[i]=a1[i];
for (int i=size1;i<size1+size2;i++) a3[i]=a2[i-size1];
}
void shuffle(int* ar, int size) {
int idx1, idx2, num;
for (int i=0;i<size;i++) {
idx1=rand()%size;
idx2=rand()%size;
num=ar[idx1];
ar[idx1]=ar[idx2];
ar[idx2]=num;
}
}
int indexOfMinimum(int ar[], int size) {
int min=ar[0], idx;
for (int i=0;i<size;i++) if (ar[i]<min) {
min=ar[i];
idx=i;
}
return idx;
}
void reverseArray(int* ar, int size) {
int num, j=0;
for (int i=size-1;i>=j;i--) {
num=ar[j];
ar[j]=ar[i];
ar[i]=num;
j++;
}
}
|