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!
2-D Array- C program:
Define a two dimension array using c.
void convert ( int a[10][10] , int[] , int , int);
void main()
{
clrscr();
int a[10][10], b[100], n, m, i, j;
cout<<"enter the number of rows of the array : ";
cin>>n;
cout<<"enter the number of columns of the array : ";
cin>>m;
for (i=0;i { for(j=0;j { cout<<"enter element "< cin>>a[i][j]; } } convert (a,b,n,m); cout< cout<<"the converted array is :"< for(i=0;i<(m*n);i++) { cout< } getch(); } void convert (int a[10][10] , int b[100] , int n , int m) { int i,j,k=0; for(i=0;i { for(j=0;j { b[k]=a[i][j]; k++; } } }
for(j=0;j { cout<<"enter element "< cin>>a[i][j]; } } convert (a,b,n,m); cout< cout<<"the converted array is :"< for(i=0;i<(m*n);i++) { cout< } getch(); } void convert (int a[10][10] , int b[100] , int n , int m) { int i,j,k=0; for(i=0;i { for(j=0;j { b[k]=a[i][j]; k++; } } }
cout<<"enter element "<
cin>>a[i][j];
}
convert (a,b,n,m);
cout< cout<<"the converted array is :"< for(i=0;i<(m*n);i++) { cout< } getch(); } void convert (int a[10][10] , int b[100] , int n , int m) { int i,j,k=0; for(i=0;i { for(j=0;j { b[k]=a[i][j]; k++; } } }
cout<<"the converted array is :"< for(i=0;i<(m*n);i++) { cout< } getch(); } void convert (int a[10][10] , int b[100] , int n , int m) { int i,j,k=0; for(i=0;i { for(j=0;j { b[k]=a[i][j]; k++; } } }
for(i=0;i<(m*n);i++)
cout<
getch();
void convert (int a[10][10] , int b[100] , int n , int m)
int i,j,k=0;
for(i=0;i { for(j=0;j { b[k]=a[i][j]; k++; } } }
for(j=0;j { b[k]=a[i][j]; k++; } } }
b[k]=a[i][j];
k++;
when you allocate memory with new[], you ought to free the memory via delete[]. While you allocate memory along 'new', then use 'delete' with no the brackets. You employ new[] to a
Problem Write a program in C++ to read N numbers in an array, the user should be able to search a particular number in the array using sequential search algorithm. Writing a
brief note on multiple stack
where to use tower of honoi?
the issue of oil spills
The Shortest Job Next (SJN) algorithm queues processes in a way that the ones that use the shortest CPU cycle will be selected for running rst. Shortest remaining time rst algori
limitation of linear array
Problem Implement a class called employee that contains name, employee number and department code. Include a member function getdata() to get data from user and store it in the
C Program for ADD,SUB,MUL,DIV,REM void main() { int a,b,c,ch=0; clrscr(); while(ch { printf(" \n\n 1:- For To Add\n 2:- For
Illustration of Grid function: For illustration, the script below creates two individual figure windows. At First, it clears the figure window. Then, it generates an x vector
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