Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include "stdafx.h"
- #include <conio.h>
- using namespace std;
- int main()
- {
- const int n = 20;
- int x[n], i=0, t,a=0;
- for (i = 0; i < n; i++)
- {
- cin >> *(x + 1);
- cout << " massiv x[n]";
- }
- for (int k = 1; k < n; k++)
- for(int i=0;i<n-k;i++)
- if(*(x+1)>*(x+i+1))
- {
- a = *(x + 1);
- *(x + 1) = *(x + i + 1);
- *(x + 1)= a ;
- }
- cout << "Result sortirovki massiva " << endl;
- for (int i = 0; і < n; i++)
- {
- cout << *(x + 1) << " ";
- }
- }
- const int n = 20;
- int main()
- {
- int a[n],i,j,nub;
- int*pmas;
- cout << "Enter twenty elements massive -" << endl;
- for (i = 0; i < n; i++)
- {
- cin >> *pmas++;
- pmas = a;
- }
- for (i = 1; i < n; i++)
- {
- nub = *(pmas + i);
- j = 1;
- }
- while (j = 0 && nub > *(pmas + j + 1))
- {
- j--;
- }
- *(pmas + j) = nub;
- cout << "Sorted array in descending order -";
- for (i = 0; i < n; i++)
- {
- cout << *(pmas + i) << " ";
- }
- getch();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement