В одномерном массиве , состоящем из n целых элементов

#include "stdafx.h"
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
 
int main(void){
int *OurArray, *SortedArray;
int i, number_of_elements,minimum;
int index_of_minimum, Sum=0;
int index_of_first_null,o;
int acc;
 
 printf ("enter a number of members of the array\n");
 scanf("%d",&number_of_elements);
OurArray=(int*)malloc(number_of_elements*sizeof(int));
 
for (i=0;i<number_of_elements;i++){
    printf("enter %d member of the array:  ", (i+1));
scanf("%d",(OurArray+i));
}
 
//Minimum
min=*(OurArray+0);
for(i=1;i<number_of_elements;i++){
if (*(OurArray+i)<min){
min=*(OurArray+i);
index_of_minimum=i;
}
}
printf("Minimum of array: %d element : %d\n",(index_of_minimum+1),min);
 
//Summa
for(i=0;i<number_of_elements;i++){
if(*(OurArray+i)==0){
index_of_first_null=i; break;
}
}
for (i=index_of_first_null;i<number_of_elements;i++){
Sum=Sum+*(OurArray+i);
}
printf("Summ =%d\n",Sum);
 
//odd
o=number_of_elements-1;
SortedArray=(int*)malloc(number_of_elements*sizeof(int));
for(i=0;i<number_of_elements;i++){
    if(i%2==0){
acc=i/2;
printf("i=%d acc=%d a[%d]=%d \n",i,acc,i, *(a+i));
    }
 
    else{
acc=o--;
printf("2.i=%d acc=%d\n",i,acc);
    }
 
*(SortedArray+acc)=*(OurArray+i);
if(i==number_of_elements-1){
        for(acc=0;acc<number_of_elements;acc++){
            printf("b[acc=%d]=%d\n",acc,*(SortedArray+acc));
        }
    }
}
 
printf("Please enter any key for quit");
getch();
free(OurArray);
free(SortedArray);
return 0;
}