Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "stdafx.h"
- #include "iostream"
- using namespace std;
- int mas[100];
- int k;
- int* pir_sort(int* mas, int n)
- {
- for (int i = n / 2; i >0 ;i--)
- {
- k = 2 * i-1;
- if ((k + 1 < n) && (mas[k] < mas[k+1])) k++;
- if (mas[i-1] < mas[k]) swap(mas[i-1], mas[k]);
- }
- swap(mas[0], mas[n - 1]);
- return mas;
- }
- int main()
- {
- int n;
- cout << "razmer:";
- cin >> n;
- cout << "massiv:";
- for (int i = 0; i < n; i++)
- {
- cin >> mas[i];
- }
- for (int i = n;i > 0;i--)
- {
- pir_sort(mas, i);
- for (int i = 0; i < n; i++)
- {
- cout << mas[i] << " ";
- }
- cout << endl;
- }
- cout << "sort:";
- for (int i = 0; i < n; i++)
- {
- cout << mas[i] << " ";
- }
- cout << endl;
- system("pause");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment