#include using namespace std; /* ALGORITHM DOES THE FOLOWING: 1) DETERMINES MAX VALUE IN INPUT ARRAY SO IT CAN STORE IT AS MINIMUM, SO THE BIGGEST NUMBER GOES LAST BECAUSE EVERY OTHER ELEMENT OF ARRAY IS SMALLER THAN HIM 2) CHECKS IF ELEMENT WE'RE CHECKING IN ARR INPUT IS ALREADY IN SORTED ARRAY, IF IT IS SKIP THAT NUMBER 3) IF THE NUMBER FROM INPUT ARR IS NOT IN SORTED ARRAY, WE CHECK IS HE SMALLER THE THE CURRENT SMALLEST 4) ONCE THE MIN IS FOUND FROM THE ARR INPUT THAT ISN'T IN SORTED ARRAY, IT STORES IT IN SORTED ARRAY */ int main() { int arrInput[5] = {8, 225, 16, 1, 1394}, arrSorted[5] = {}; /* -----------------------------------CASE OF USER INPUT------------------------------*/ /* int n; cout << "Enter number of array elements: "; cin >> n; int arrInput[n], arrSorted[n]; for (int i = 0; i < n; i++) { cout << "Element #" << i << " of array: "; cin >> arrInput[i]; } */ int max = arrInput[0]; for (int i = 0; i < 5; i++) { if (arrInput[i] > max) max = arrInput[i]; } int min; bool flag; for (int i = 0; i < 5; i++) { min = max; for (int j = 0; j < 5; j++) { for (int k = 0; k < 5; k++) { if (arrSorted[k] == arrInput[j]) {flag = true; break;} else flag = false; } if(flag) continue; if (arrInput[j] < min) min = arrInput[j]; } arrSorted[i] = min; } cout << "Array before sorting\n"; for (int i = 0; i < 5; i++) { cout << arrInput[i] << endl; } cout << "\nArray after sorting\n"; for (int i = 0; i < 5; i++) { cout << arrSorted[i] << endl; } return 0; }

Double array sorting algorithm