2005063
2005063
#include<stdio.h>
#include<stdlib.h>
int main()
int *p,n,i;
scanf("%d",&n);
p=(int*)malloc(n * sizeof(int));
printf("\nEnter %d Numbers:\n\n",n);
for(i=0;i<n;i++)
scanf("%d",p+i);
for(i=n-1;i>=0;i--)
printf(" %d",*(p+i));
return 0;
Q2
#include<iostream>
int next, i, j;
next = -1;
next = arr[j];
break;
int main()
int n = sizeof(arr)/sizeof(arr[0]);
printNGE(arr, n);
return 0;
Q1
#include <bits/stdc++.h>
// is always -1
arr[size-1] = -1;
arr[i] = max_from_right;
max_from_right = temp;
int i;
int main()
return (0);
Q2
#include<iostream>
if (n <= 1)
return;
prev = curr;
// Driver program
int main()
int n = sizeof(arr)/sizeof(arr[0]);
modify(arr, n);
return 0;
Q3
#include <stdio.h>
void main()
scanf("%d", &array1[i][j]);
array2[i][j] = array1[i][j];
printf("\n");
{
a = array1[i][j];
array1[i][j] = array1[i][k];
array1[i][k] = a;
printf("\n");
a = array2[i][j];
array2[i][j] = array2[k][j];
array2[k][j] = a;
}
for (i = 0; i < m; ++i)
printf("\n");
Q3
#include <algorithm>
#include <iostream>
int main()
return 0;
}
Q4
#include <algorithm>
#include <iostream>
int main()
return 0;
Q5
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <ctype.h>
int main()
int arrayNum[15];
int a;
int max=0;
int location;
scanf("%d",&arrayNum[a]);
printf("%d\n", arrayNum[a]);
max = arrayNum[a];
location = a+1;
printf("Max element in the array in the location %d and its value %d\n", location, max);
for(a=0; a<15; a++)
if(arrayNum[a+1] == arrayNum[a])
continue;
else
return 0;
Q6
#include <bits/stdc++.h>
if (arr[i] == 0)
count++;
arr[i] = 0;
// Loop fills remaining arr space with 1
arr[i] = 1;
// Driver function
int main()
int arr[] = { 0, 1, 0, 1, 1, 1 };
segregate0and1(arr, n);
print(arr, n);
return 0;
Q7#include <bits/stdc++.h>
int l = 0, r = n - 1;
int k = 0;
while (l < r)
while (arr[l] % 2 != 0)
l++;
k++;
r--;
// number right.
if (l < r)
swap(arr[l], arr[r]);
}
// Sort odd number in descending order
// Driver code
int main()
int arr[] = { 1, 3, 2, 7, 5, 4 };
twoWaySort(arr, n);
return 0;