Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //НУЖНО ПРОВЕРИТЬ ЭТУ ДИЧЬ!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
- #include "pch.h"
- #include <iostream>
- #include <cmath>
- using namespace std;
- void sortmas(int k, int l, double *mas1, int s);
- int imin(int s, double *mas1);
- int imax(int s, double *mas1);
- int main()
- {
- int n;
- cout << "Enter n: " << endl;
- cin >> n;
- double *mas = new double[n];
- cout << "Enter mas: " << endl;
- for (int i = 0; i < n; i++)
- {
- cin >> mas[i];
- }
- double max = mas[0];
- double min = mas[0];
- int low, high;
- /*for (int i = 0; i < n; i++)
- {
- if (fabs(mas[i]) >= max)
- {
- max = mas[i];
- imax = i;
- }
- if (fabs(mas[i]) <= min)
- {
- min = mas[i];
- imin = i;
- }
- }*/
- low=imin(n, mas);
- high = imax(n, mas);
- sortmas(low, high, mas, n);
- return 0;
- }
- void sortmas(int k, int l, double *mas1, int s)
- {
- int b = 0;
- for (int i = k; i <= l - 3; i++)
- {
- for (int j = k + 1; j <= l - 2 - b; j++)
- if (mas1[j] < mas1[j + 1])
- {
- int t = mas1[j];
- mas1[j] = mas1[j + 1];
- mas1[j + 1] = t;
- }
- b++;
- }
- for (int i = 0; i < s; i++)
- {
- cout << mas1[i];
- }
- }
- int imin(int s, double *mas1)
- {
- int minx = -1;
- double min = mas1[0];
- for (int i = 0; i < s; i++)
- {
- if (fabs(mas1[i]) <= min)
- {
- min = mas1[i];
- minx = i;
- }
- }
- return minx;
- }
- int imax(int s, double *mas1)
- {
- int maxx = -1;
- double max = mas1[0];
- for (int i = 0; i < s; i++)
- {
- if (fabs(mas1[i]) >= max)
- {
- max = mas1[i];
- maxx = i;
- }
- }
- return maxx;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement