i dn k=12*45
//the following code will help you to write the program for(i=n-1, j=0; i > 0; i--, j++) //n is the order of the square matrix { for(k=j; k < i; k++) printf("%d ", a[j][k]); for(k=j; k < i; k++) printf("%d ", a[k][i]); for(k=i; k > j; k--) printf("%d ", a[i][k]); for(k=i; k > j; k--) printf("%d ", a[k][j]); } m= (n-1)/2; //calculate the position of the middle element if (n% 2 == 1) printf("%d", a[m][m]);//to print the middle element also //9809752937(udanesh)
#include<iostream.h> #include<conio.h> void main() { clrscr(); int i,k,a[10],c[10],n,l; cout<<"Enter the no. of elements\t"; cin>>n; cout<<"\nEnter the sorted elments for optimal merge pattern"; for(i=0;i<n;i++) { cout<<"\t"; cin>>a[i]; } i=0;k=0; c[k]=a[i]+a[i+1]; i=2; while(i<n) { k++; if((c[k-1]+a[i])<=(a[i]+a[i+1])) { c[k]=c[k-1]+a[i]; } else { c[k]=a[i]+a[i+1]; i=i+2; while(i<n) { k++; if((c[k-1]+a[i])<=(c[k-2]+a[i])) { c[k]=c[k-1]+a[i]; } else { c[k]=c[k-2]+a[i]; }i++; } }i++; } k++; c[k]=c[k-1]+c[k-2]; cout<<"\n\nThe optimal sum are as follows......\n\n"; for(k=0;k<n-1;k++) { cout<<c[k]<<"\t"; } l=0; for(k=0;k<n-1;k++) { l=l+c[k]; } cout<<"\n\n The external path length is ......"<<l; getch(); }
Special K
Yes, they are exactly the same, both of them increment k in 1.
0.9765625 MB = 1000KB.
1000kb is 1mb and 1000mb is 1gb. Therefore, 67921kb is 67.921mb or 0.067921gb.
This is not very accurate. but about 4.189 MB Because 1000KB is about equal to 1MB
500mb equals 500000 Kb 1 Mb= 1000Kb
2GB is much bigger than 31KB 1GB is 100MB and 1MB is 1000KB
no its 1024kb
0.203 There are 1000kb in 1Mb
Binary type(1024kb=1mb)=approxiamately 720Mb(719.8mb) Normal Type(1000kb=1mb)=approxiamtely737Mb(737.1Mb)
2.5GB because 1000KB equals 1GB
if 1mb is 1000kb 14532 / 1000 = 14.532mb the answer is no
There are 1000kb in 1mb so in 9.7mb there are 9700kb.
1MB is equal to 1000KB.