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 #include using namespace std; int Search(int* Arr, const int n) { Arr[n-1] = 3; int i = 0; while(true) { if (Arr[i] == 3) break; i++; } return n-1 == i ? -1 : i; } int main() { int iArr[8] = { 6, 4, 3, 2, 1, 9, 8, }; const int nx = 8; int ..
