Question

You are given an array a of n integers a subarray is comtinouse segment of array element the minimum of a subarray here is the minimum among all element present in that sub array. A list a is obtain from a as follows intially a is empty now we find the inimum of the all subarray of a and add it to a agter this a is sorted for array 2 1 3

Answer 1

Answer:

Sum of digits in C

#include <stdio.h>

int main()

{

int n, t, sum = 0, remainder;

printf("Enter an integer\n");

scanf("%d", &n);

t = n;

while (t != 0)