Sort by

recency

|

834 Discussions

|

  • + 0 comments
    #include <stdio.h>
    #include <stdlib.h>
    
    int main()
    {
        int num, *arr, i;
        scanf("%d", &num);
        arr = (int*) malloc(num * sizeof(int));
        for(i = 0; i < num; i++) {
            scanf("%d", arr + i);
        }
    
        /* Write the logic to reverse the array. */
        int temp;
        for(i = 0; i < num/2; i++) {
            temp = arr[i];
            arr[i] = arr[num-1-i];
            arr[num-1-i] = temp;
        }
    
        for(i = 0; i < num; i++)
            printf("%d ", *(arr + i));
        return 0;
    }
    }
    
  • + 0 comments
    /* Write the logic to reverse the array. */
        int temp;
        int len = num;
        for(i = 0;i < len; i++,len--){
            temp = arr[i];
            arr[i] = arr[len-1];
            arr[len-1]= temp;
        }
    
  • + 1 comment

    include

    include

    int main() { int num, arr, i; scanf("%d", &num); arr = (int) malloc(num * sizeof(int)); for(i = 0; i < num; i++) { scanf("%d", arr + i); }

    for(i = num-1; i >= 0; i--)
        printf("%d ", *(arr + i));
    return 0;
    

    }

  • + 0 comments

    include

    int main() { int size; scanf("%d", &size); int arr[size]; for (int i = 0; i < size; i++) { scanf("%d", &arr[i]); } for (int i = size - 1; i >= 0; i--) { printf("%d ", arr[i]);

         }
          return 0; 
    
    }
    
  • + 0 comments
    int num, *arr, i;
        scanf("%d", &num);
        arr = (int*) malloc(num * sizeof(int));
        for(i = 0; i < num; i++) {
            scanf("%d", arr + i);
        }
        /* Write the logic to reverse the array. */
        for(i = 0; i < (num/2); i++){
                arr[i]= arr[i] + arr[num-(i+1)];
                arr[num-(i+1)] = arr[i] - arr[num-(i+1)];
                arr[i] = arr[i] - arr[num-(i+1)];
        }
        for(i=0; i<num; i++)printf("%d ",arr[i]);