fork download
  1. #include <iostream>
  2. #include <iomanip>
  3.  
  4. using namespace std;
  5.  
  6. template <typename T, size_t N, size_t M>
  7. void Sort(T (*mas)[N][M])
  8. {
  9. int k = 0;
  10. do {
  11. for (int i = 0; i < M; i++)
  12. {
  13. for (int j = M-1; j > i; j--)
  14. {
  15. if ((*mas)[k][j] < (*mas)[k][j - 1])
  16. {
  17. T tmp = (*mas)[k][j];
  18. (*mas)[k][j] = (*mas)[k][j - 1];
  19. (*mas)[k][j - 1] = tmp;
  20. }
  21. }
  22. }
  23. k++;
  24. } while (k < N);
  25. }
  26.  
  27. int main(int argc, char * argv[])
  28. {
  29. int a[5][7];
  30. for (int i = 0; i < 5; i++)
  31. for (int j = 0; j < 7; j++)
  32. a[i][j] = rand()%20;
  33.  
  34. for (int i = 0; i < 5; i++)
  35. {
  36. for (int j = 0; j < 7; j++)
  37. cout << a[i][j] << "\t";
  38. cout << "\n";
  39. }
  40. cout << "\n";
  41. cout << "\n";
  42.  
  43. Sort(&a);
  44.  
  45. for (int i = 0; i < 5; i++)
  46. {
  47. for (int j = 0; j < 7; j++)
  48. cout << a[i][j] << "\t";
  49. cout << "\n";
  50. }
  51. }
  52.  
Success #stdin #stdout 0.01s 5568KB
stdin
Standard input is empty
stdout
3	6	17	15	13	15	6	
12	9	1	2	7	10	19	
3	6	0	6	12	16	11	
8	7	9	2	10	2	3	
7	15	9	2	2	18	9	


3	6	6	13	15	15	17	
1	2	7	9	10	12	19	
0	3	6	6	11	12	16	
2	2	3	7	8	9	10	
2	2	7	9	9	15	18