Advertisement
Guest User

Untitled

a guest
Nov 23rd, 2017
77
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.09 KB | None | 0 0
  1. #include<stdio.h>
  2. void nhapmang(int a[20][20], int n, int m)
  3. {
  4. for (int i = 0; i < n; i++)
  5. for (int j = 0; j < m; j++)
  6. {
  7. printf("a[%i][%i] = ", i, j); scanf("%i", &a[i][j]);
  8. }
  9. }
  10. void sapxep(int a[], int m)
  11. {
  12. int n = m;
  13. for (int j = 0; j < n; j++){
  14. int max = 0, vitri = 0;
  15. for (int i = 0; i < m; i++){ //tim max, cho no vao vitri cuoi dong va lap lai
  16. if (a[i]>max){ max = a[i]; vitri = i; }
  17. if (i == m - 1){
  18. a[vitri] = a[i];
  19. a[i] = max;
  20. m--;
  21. }
  22. }
  23. }
  24. }
  25. void main()
  26. {
  27. int a[20][20],n,m;
  28. int b[400],h=0;
  29. while (1){
  30. printf("Nhap so dong va so cot cua mang: "); scanf("%i %i", &n, &m);
  31. if (m<1 || n<1 || m>20 || n>20)continue;
  32. break;
  33. }
  34. nhapmang(a, n, m);
  35. for (int i = 0; i < n;i++)
  36. for (int j = 0; j < m; j++){
  37. b[h] = a[i][j];
  38. h++;
  39. }
  40. sapxep(b, h+1);
  41. h = 0;
  42. for (int i = 0; i < n; i++)
  43. for (int j = 0; j < m; j++){
  44. a[i][j]=b[h];
  45. h++;
  46. }
  47. printf("Ma tran sau khi sap xep: \n");
  48. for (int i = 0; i < n; i++){
  49. for (int j = 0; j < m; j++){ printf("%i ", a[i][j]); }
  50. printf("\n");
  51. }
  52. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement