Find the maximum length of the subarray in increasing order.
For example we have an array {5,4,6,-2,-1,0,1,9}. The biggest sub-array in increasing order is: {-2,-1,0,1,9}. So the length is 5. #include<stdio.…
For example we have an array {5,4,6,-2,-1,0,1,9}. The biggest sub-array in increasing order is: {-2,-1,0,1,9}. So the length is 5. #include<stdio.…
#include <stdio.h> #define R 3 #define C 3 void spiralPrint(int m, int n, int a[R][C]) { int i, k = 0, l = 0; /* k - starting row inde…
#include<stdio.h> #include<conio.h> int main() { char str[20], ch; int count = 0, i,j=0 , max; int arr[10]; printf("\nE…
#include<stdio.h> void clearmyscreen(); void main() { printf("Hello"); getch(); clearmyscreen(); printf("World"); …
#include<stdio.h> void main() { int n1,n2,n3; printf("Enter Numbers (n1 n2 n3) : "); scanf("%d %d %d",&n1,&n2,&a…
Solution: 1 #include<stdio.h> void main(){ if(printf("Hello world")){ } } Solution: 2 #include<stdio.h> void main(){ …