Page 462 - computer science (868) class 11
P. 462
44 //SORT THE 1-D ARRAY IN ASCENDING ORDER
45 for(i=0;i< x;i++)
46 {
47 for(j=i+1;j< x;j++)
48 {
49 if(b[i]>b[j])
50 {
51 t=b[i];
52 b[i]=b[j];
53 b[j]=t;
54 }
55 }
56 }
57 //PLACE THE SORTED ELEMENTS FROM 1-D
58 //ARRAY INTO THE 2-D ARRAY
59 c=0;
60 for(i=0;i< n;i++)
61 a[0][i]=b[c++];
62 for(i=1;i< m;i++)
63 a[i][n-1]=b[c++];
64 for(i=n-2;i>=0;i--)
65 a[m-1][i]=b[c++];
66 for(i=m-2;i> 0;i--)
67 a[i][0]=b[c++];
68 System.out.println("REARRANGED MATRIX : ");
69 for(i=0;i< m;i++)
70 {
71 for(j=0;j< n;j++)
72 System.out.print(a[i][j]+" ");
73 System.out.println();
74 }
75 System.out.println("BOUNDARY ELEMENTS : ");
76 for(i=0;i< m;i++)
77 {
460460 Touchpad Computer Science-XI

