Академический Документы
Профессиональный Документы
Культура Документы
int main() {
int i, n, sum_half = 0, X[100], removed = 0, random;
}
Result:
Enter total number of elements(up to 100): 6
1. 41
2. 67
3. 34
4. 0
5. 69
6. 24
Sum of first half : 142
Difference of maximum and minimum : 69
Array without 0:
1. 41
2. 67
3. 34
4. 69
5. 24
--------------------------------
Process exited after 2.66 seconds with return value 0
Press any key to continue . . .