1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139
|
#include <iostream>
#include <cstdlib>
#include <ctime>
#include <iomanip>
using namespace std;
void InputArray (int[]);
void OutputArray (int[]);
void Swap (int[], int[]);
void SortIntegers(int[], int[], int[], int[], int[]);
const int ARRAY_MAX = 5; // Constant is 5 because we are accepting exactly 5 integers (0,1,2,3,4)
int main ()
{
int intNumbersArray[ARRAY_MAX];
InputArray(intNumbersArray);
OutputArray(intNumbersArray);
system("pause");
return 0;
}
void InputArray (int intNumbersArray[])
{
for (int intCounter = 0; intCounter < ARRAY_MAX; intCounter++)
{
cout << "Enter an integer: " << endl;
cin >> intNumbersArray[intCounter];
}
}
void OutputArray(int intNumbersArray[])
{
int intCounter = 0;
for (int intCounter = 0; intCounter < ARRAY_MAX; intCounter++)
{
cout << intNumbersArray[0] << intNumbersArray[1] << intNumbersArray[2] << intNumbersArray[3] << intNumbersArray[4] << endl;
}
cout << "You entered: " << endl;
cout << intNumbersArray[intCounter] << endl;
cout << "Integers in Ascending order (lowest-to-greatest)" << endl;
SortIntegers (&intNumbersArray[0], &intNumbersArray[1],&intNumbersArray[2],&intNumbersArray[3],&intNumbersArray[4]);
cout << intNumbersArray[0] << intNumbersArray[1] << intNumbersArray[2] << intNumbersArray[3] << intNumbersArray[4] << endl;
}
void Swap(int &intValueX, int &intValueY)
{
int intValueTemp = intValueX;
intValueTemp = intValueY;
intValueY = intValueX;
intValueX = intValueTemp;
}
// Function to sort integers in ascending order (lowest to greatest)
void SortIntegers(int &intNumbersArray[0],int &intNumbersArray[1],int &intNumbersArray[2],int &intNumbersArray[3],int &intNumbersArray[4])
{
while (true) // Sort Ascending Conditions
{
if (intNumbersArray[0] > intNumbersArray[1])
{
Swap(intNumbersArray[0],intNumbersArray[1])
}
if (intNumbersArray[1] > intNumbersArray[2])
{
Swap(intNumbersArray[1],intNumbersArray[2])
}
if (intNumbersArray[2] > intNumbersArray[3])
{
Swap(intNumbersArray[2], intNumbersArray[3]);
}
if (intNumbersArray[3] > intNumbersArray[4])
{
Swap(intNumbersArray[3], intNumbersArray[4]);
}
if (intNumbersArray[1] > intNumbersArray[4])
{
Swap(intNumbersArray[1],intNumbersArray[4])
}
if ((intNumbersArray[0] < intNumbersArray[1]) && (intNumbersArray[1] < intNumbersArray[2]) && (intNumbersArray[2] < intNumbersArray[3]) &&
(intNumbersArray[3] < intNumbersArray[4) && (intNumbersArray[1] < intNumbersArray[4]))
{
break;
}
}
while (true) // Sort Descending Conditions
{
if (intNumbersArray[0] < intNumbersArray[1])
{
Swap(intNumbersArray[0],intNumbersArray[1])
}
if (intNumbersArray[1] < intNumbersArray[2])
{
Swap(intNumbersArray[1],intNumbersArray[2])
}
if (intNumbersArray[2] < intNumbersArray[3])
{
Swap(intNumbersArray[2], intNumbersArray[3]);
}
if (intNumbersArray[3] < intNumbersArray[4])
{
Swap(intNumbersArray[3], intNumbersArray[4]);
}
if (intNumbersArray[1] < intNumbersArray[4])
{
Swap(intNumbersArray[1],intNumbersArray[4])
}
if ((intNumbersArray[0] > intNumbersArray[1]) && (intNumbersArray[1] > intNumbersArray[2]) && (intNumbersArray[2] > intNumbersArray[3]) &&
(intNumbersArray[3] > intNumbersArray[4) && (intNumbersArray[1] > intNumbersArray[4]))
{
break;
}
}
}
|