Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdlib>
- #include <cmath>
- using namespace std;
- bool drugie(int, int*);
- void babelkowe(int, int*);
- int main(int argc, char* args[]) {
- int* ints = new int[argc - 1];
- for (int i = 0; i < argc - 1; i++)
- ints[i] = atoi(args[i + 1]);
- bool sorted = drugie(argc - 1, ints);
- if(sorted)
- cout << "Podane liczby były już posortowane" << endl;
- else {
- cout << "Podane liczby nie były posortowane." << endl;
- cout << "Powinno to wyglądać tak:" << endl;
- babelkowe(argc - 1, ints);
- for (int i = 0; i < argc - 1; i++)
- cout << ints[i] << " ";
- }
- delete[] ints;
- }
- bool drugie(int argc, int* args) {
- bool rosnaco = false;
- if (argc <= 2)
- return true;
- int checkedIndex = 2;
- for (; checkedIndex < argc; checkedIndex++) {
- int roznica = args[checkedIndex] - args[checkedIndex - 1];
- if (roznica) {
- rosnaco = roznica > 0;
- break;
- }
- }
- for (; checkedIndex < argc; checkedIndex++) {
- int roznica = args[checkedIndex] - args[checkedIndex - 1];
- if (roznica) {
- if ((rosnaco && roznica < 0) || (!rosnaco && roznica > 0))
- return false;
- }
- }
- return true;
- }
- void babelkowe(int argc, int* args) {
- for(int i = 1; i < argc; i++)
- for(int j = argc-1; j >= 1; j--)
- if (args[j] < args[j - 1]) {
- int oldValue;
- oldValue = args[j - 1];
- args[j - 1] = args[j];
- args[j] = oldValue;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement