Advertisement
Guest User

Untitled

a guest
Apr 21st, 2015
179
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.81 KB | None | 0 0
  1. #include<stdio.h>
  2. #include<stdlib.h>
  3. void disp(int *x,int y);
  4.  
  5. void read(int *x,int y)
  6.  
  7. {
  8. printf("Enter %d elements: ",y*y);
  9. int i,j;
  10. for(i=0;i<y;i++)
  11. {
  12. for(j=0;j<y;j++)
  13. {
  14.  
  15. scanf("%d",x+y*i+j);
  16. }
  17. }
  18. }
  19.  
  20. void sort(int *x,int y)
  21. {
  22. int n=y*y;
  23. int i,j;
  24. int min;
  25. int temp;
  26. for(i=0;i<n;i++)
  27.  
  28. {
  29. min=i;
  30. for(j=i;j<n;j++)
  31. {
  32. if(x[j]<x[min]) min = j;
  33. }
  34. temp=x[i];
  35. x[i]=x[min];
  36. x[min]=temp;
  37.  
  38. }
  39. }
  40.  
  41. void asq(int *x,int y)
  42. {
  43. int *sq;
  44. sq=(int *)malloc(y*y*sizeof(int));
  45. int i,j,k;
  46. for(i=0;i<y*y;i++)
  47. *(sq+i)=0;
  48. for(i=0;i<y;i++)
  49. for(j=0;j<y;j++)
  50. for(k=0;k<y;k++)
  51. *(sq+i*y+j)+=*(x+i*y+k)**(x+k*y+j);
  52. disp(sq,y);
  53. }
  54. void disp(int *x,int y)
  55. {
  56. int i,j;
  57. for(i=0;i<y;i++)
  58. {
  59. for(j=0;j<y;j++)
  60. {
  61. printf(" %d",*(x+i*y+j));
  62. }
  63. printf("\n");
  64. }
  65. }
  66. int main()
  67.  
  68. {
  69.  
  70. int n;
  71. int *in,*square,*sorted,i,j;
  72. printf("Enter n: ");
  73. scanf("%d",&n);
  74. in= (int *)malloc(n*n*sizeof(int));
  75. square= (int *)malloc(n*n*sizeof(int));
  76. for(i=0;i<n;i++)
  77. for(j=0;j<n;j++)
  78. *(in + n*i + j)=0;
  79. while(1) {
  80. int choice;
  81. printf("\nEnter choice: \n1. Enter elements of array\n2. sort the array\n3. square the array\n4. display the array\n5. Exit\n");
  82. scanf("%d", &choice);
  83. if(choice == 1)
  84. read(in,n);
  85. else if(choice == 2)
  86. sort(in,n);
  87. else if(choice == 3)
  88. asq(in,n);
  89. else if(choice == 4)
  90. disp(in,n);
  91. else if(choice == 5)
  92. break;
  93. else
  94. printf("Invalid input!\n");
  95. }
  96. return 0;
  97. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement