Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
#include stdio.h>
#include conio.h>
#include string.h>
void main()
{
int i=0,j=0,k=0,l=0;
int a[3][3],temp[3][3];
clrscr();
for(i=0;i<3;i++)
for(j=0;j<3;j++)
a[i][j]=0;
temp[i][j]=0;
}
} i=0;j=0;
printf("ENTER THE VALUE %d %d: ",i+1,j+1);
scanf("%d",&a[i][j]);
for(k=0;k<3;k++)
for(l=0;l<3;l++)
if(a[i][j] { temp[i][j]=a[i][j]; a[i][j]=a[k][l]; a[k][l]=temp[i][j]; } } } } } printf("\nNO ARE IN ACCENDING ORDER"); printf("\n"); for(i=0;i<3;i++) { for(j=0;j<3;j++) printf("%d\t",a[i][j]); printf("\n"); } getch(); } OUTPUT : ENTER THE LIMIT OF ELEMENTS: 3 ENTER THE NO 1 : 2 ENTER THE NO 2 : 3 ENTER THE NO 3 : 4 THE EVEN NO.S ARE 2 THE ODD NO.S ARE 1 THE TOTAL OF EVEN NO IS 6 THE TOTAL OF ODD NO IS 3 THE AVG. OF ALL EVEN NO IS 3.0000 THE AVG. OF ALL ODD NO IS 3.0000
temp[i][j]=a[i][j];
a[i][j]=a[k][l];
a[k][l]=temp[i][j];
printf("\nNO ARE IN ACCENDING ORDER");
printf("\n");
printf("%d\t",a[i][j]);
getch();
OUTPUT :
ENTER THE LIMIT OF ELEMENTS: 3
ENTER THE NO 1 : 2 ENTER THE NO 2 : 3
ENTER THE NO 3 : 4
THE EVEN NO.S ARE 2 THE ODD NO.S ARE 1
THE TOTAL OF EVEN NO IS 6
THE TOTAL OF ODD NO IS 3
THE AVG. OF ALL EVEN NO IS 3.0000
THE AVG. OF ALL ODD NO IS 3.0000
what is the function of spanning tree in graph algorithm?
Data array A has data series from 1,000,000 to 1 with step size 1, which is in perfect decreasing order. Data array B has data series from 1 to 1,000,000, which is in random order.
#give me the code
Define conversion operator??
Project Description: I'm seeking someone who could write me a torrent seeding client which supports multiple proxies. The goal of the project is to make torrents popular by seed
Program to draw a circle: int main(void) { /* request auto detection */ int gdriver = DETECT, gmode, errorcode; int midx, midy; int radius = 100;
how can I find the GCD of 2 given numbers using Euclidean Algorithm ?
Develop a Student class that has the following header file: #ifndef STUDENT_H #define STUDENT_H #include #include #include using namespace std; class Stu
find the occurence of zy in the final string
syntax
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd