Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- vector<int> sortingArray(vector<int> A) {
- int max;
- int csere;
- for (int i = 0;i < A.size() - 1; i++){
- max = i;
- for (int j = i + 1; j < A.size(); j++){
- if (A[j] < A[max]){
- max = j;
- }
- }
- if (i != max ){
- csere = A[i];
- A[i] = A[max];
- A[max] = csere;
- }
- }
- return A;
- }
- printArray(vector<int> A) {
- cout << "Rendezett Array:" << endl;
- for (int l = 0; l < A.size(); l++) {
- if(l % 4 == 0 && l != 0){
- cout << endl;
- }
- cout << A[l] << " ";
- }
- cout << endl;
- }
- int main()
- {
- int tombMeret;
- int a;
- cin >> tombMeret;
- vector<int> tomb;
- while (cin >> a) {
- tomb.push_back(a);
- if (tomb.size() == tombMeret) {
- break;
- }
- }
- cout << "Megadott input:" << endl;
- for (int l = 0; l < tomb.size(); l++) {
- if(l % 4 == 0 && l != 0){
- cout << endl;
- }
- cout << tomb[l] << " ";
- }
- cout << endl;
- vector<int> sorted;
- sorted = sortingArray(tomb);
- printArray(tomb);
- printArray(sorted)
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement