Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Wczytac n liczb do tablicy a o rozmiarze n. Zamienic wartosciami liczbe najwieksza z najmniejsza.
- // Uporzadkowac wartosci w ciag niemalejacy. Wczytac liczbe x i wstawic ja do tablicy zachowujac uporzadkowanie
- #include <iostream>
- using namespace std;
- const int n = 5;
- int main(void){
- int tab[n];
- for(int i = 0; i < n; i++){
- cin >> tab[i];
- }
- int max = tab[0];
- int min = tab[0];
- int imin = 0;
- int imax = 0;
- for(int i = 0; i < n; i++){
- if(tab[i] > max){
- max = tab[i];
- imax = i;
- } else if(tab[i] < min){
- min = tab[i];
- imin = i;
- }
- }
- for(int i = 0; i < n; i++){
- cout << tab[i] << '\t';
- }
- cout << endl << endl;
- int temp = tab[imin];
- tab[imin] = tab[imax];
- tab[imax] = temp;
- for(int i = 0; i < n; i++){
- cout << tab[i] << '\t';
- }
- cout << endl << endl;
- for(int j = 0; j < n-1; j++){
- for(int i = 0; i < n-1-j; i++){
- if(tab[i] > tab[i+1]){
- int tmp = tab[i];
- tab[i] = tab[i+1];
- tab[i+1] = tmp;
- }
- }
- }
- for(int i = 0; i < n; i++){
- cout << tab[i] << '\t';
- }
- int x;
- cout << endl << "Podaj wartosc x" << endl;
- cin >> x;
- int idx = 0;
- for(int i = 0; i < n-1; i++){
- if(x >= tab[i] && x < tab[i+1]){
- idx = i+1;
- break;
- } else if(x > tab[n-1]){
- idx = n-1;
- }
- }
- for(int i = n-1; i > idx; i--){
- tab[i] = tab[i-1];
- }
- tab[idx] = x;
- cout << endl << endl;
- for(int i = 0; i < n; i++){
- cout << tab[i] << '\t';
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement