Advertisement
konevLOX

Untitled

Nov 17th, 2019
118
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.12 KB | None | 0 0
  1. static void Delete(double[,] x, int a, int k)
  2. {
  3. for (int i = a; i < k - 1; i++)
  4. {
  5. for (int j = 0; j < k; j++)
  6. {
  7. double p = x[j, i];
  8. x[j, i] = x[j, i + 1];
  9. x[j, i + 1] = p;
  10. }
  11. }
  12. }
  13. static void MaxMin(double[,] x, out int imax1, out int imin1, int k)
  14. {
  15. double amax = x[0, 0], amin = x[0, 1];
  16. imax1 = 0; imin1 = 1;
  17. for (int i = 0; i < k; i++)
  18. {
  19. for (int j = 0; j <= i; j++)
  20. {
  21. if (x[i, j] > amax)
  22. {
  23. amax = x[i, j];
  24. imax1 = j;
  25. }
  26. }
  27. for (int y = i + 1; y < k; y++)
  28. {
  29. if (x[i, y] < amin)
  30. {
  31. amin = x[i, y];
  32. imin1 = y;
  33. }
  34. }
  35. }
  36. }
  37. static void Main(string[] args)
  38. {
  39. const int n = 4;
  40. double[,] a = new double[n, n] { { 4, 5, 6, 8 } ,
  41. { 3, 6, 7, 9 } ,
  42. { 8, 4, 1, 3 } ,
  43. { 7, 5, 6, 3 } };
  44. int imax, imin, cnt = n;
  45. MaxMin(a, out imax, out imin, n);
  46. if (imax == imin)
  47. {
  48. Delete(a, imax, n);
  49. cnt--;
  50. }
  51. if (imin > imax)
  52. {
  53. Delete(a, imin, n);
  54. Delete(a, imax, n);
  55. cnt -= 2;
  56. }
  57. else
  58. {
  59. Delete(a, imax, n);
  60. Delete(a, imin, n);
  61. cnt -= 2;
  62. }
  63. for (int i = 0; i < n; i++)
  64. {
  65. for (int j = 0; j < cnt; j++)
  66. Write("{0} ", a[i, j]);
  67. WriteLine();
  68. }
  69. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement