Advertisement
Guest User

Untitled

a guest
Sep 24th, 2017
47
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.61 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3. #include <iomanip>
  4.  
  5. using namespace std;
  6.  
  7. ifstream in ("input.txt");
  8. ofstream out ("output.txt");
  9.  
  10. void kek (int *a, int n)
  11. {
  12. int temp;
  13. int lowindex, lowkey, i, j;
  14. for( i=0; i<n-1; i++)
  15. {
  16. lowindex = i;
  17. lowkey = a[i];
  18.  
  19. for (j=i+1; j<n; j++) if (a[j]>lowkey) {lowkey=a[j]; lowindex=j;}
  20.  
  21. temp=a[i];
  22. a[i]=a[lowindex];
  23. a[lowindex]=temp;
  24. }
  25. for (int i=0; i<n; i++)
  26. cout << a[i] << " ";
  27. cout<< endl;
  28. }
  29. int main()
  30. {
  31. int aray[10][10];
  32. int n;
  33.  
  34. in >> n;
  35.  
  36. for (int i=0; i<n; i++)
  37. for (int j=0; j<n; j++)
  38. in >> aray[i][j];
  39.  
  40.  
  41. int b[10];
  42.  
  43. for (int i = n - 2; i >= 0; i--)
  44. {
  45.  
  46. for (int j = 0; j<n - i; j++)
  47. {
  48. b[j] = aray[j][i + j];
  49.  
  50. }
  51.  
  52. kek(b, n - i);
  53. for (int j = 0; j<n - i; j++)
  54. {
  55. aray[j][i + j] = b[j];
  56. //cout << b[j] << " ";
  57. }
  58. }
  59.  
  60. int b2[10];
  61.  
  62. for (int i = 1; i<n - 1; i++)
  63. {
  64. int k=0;
  65. for (int j = i; j <= n - 1; j++)
  66. {
  67. b2[k] = aray[j][j - i];
  68. // cout << b2[j];
  69. cout<< b2[k] << "_";
  70. k++;
  71.  
  72. }
  73. kek(b2,n-i );
  74. k=0;
  75.  
  76. for (int j = i; j <= n - 1; j++)
  77. {
  78.  
  79. cout << "Sort "<<b2[k] << endl;
  80.  
  81. aray[j][j - i] = b2[k];
  82. k++;
  83. }
  84. }
  85.  
  86.  
  87.  
  88. for (int i=0; i<n; i++)
  89. {
  90. for (int j=0; j<n; j++)
  91. out<<" "<<aray[i][j];
  92. out<<'\n';
  93. }
  94.  
  95.  
  96. in.close();
  97. out.close();
  98. return 0;
  99. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement