simple, eto. Pero it contains questionable practices eg, not using functions, using scanf (scanf should be avoided at all cost), not using pointers, etc.
For demo lang ito,
C:
#include <stdio.h>
#define SIZE 10
struct st_index {
int in;
int value;
};
int main(int argc, char* argv[]) {
int temp = 0;
int index = 0;
int arr[SIZE];
for (int i=0; i<SIZE; i++) {
arr[i] = 0;
}
printf("\nInitializing all array members to 0\n");
for (int i=0; i<SIZE; i++) {
arr[i] = 0;
}
printf("\n");
printf("Now enter the array elements\n");
for (int i=0; i<SIZE; i++) {
int temp;
printf("Enter num %d: ", i+1);
scanf("%d", &temp);
arr[i] = temp;
}
for (int i=0; i<SIZE; i++) {
if (arr[i] > arr[index]) {
index = i;
}
}
struct st_index myindex;
myindex.in = index;
myindex.value = arr[myindex.in];
printf("\nKick the biggest number out and shift the numbers towards the left.\nThen filled the last element with 0\n\n");
for (int i=0; i<SIZE; i++) {
if (i==SIZE-1) {
arr[i] = 0;
} else if (i>=index) {
arr[i] = arr[i+1];
}
printf("%d ", arr[i]);
}
printf("\n\nThe number %d at previous index %d has been kicked out\n\n", myindex.value, myindex.in);
return 0;
}