#include <iostream>
#include <iomanip>
#include <string>

using namespace std;


// Function med boublesort som sorterar efter max


double maxsort(double howMany, int seq[])
{
for ( int pass = 1; pass <= howMany - 1; pass++ ) // passes

for (int i = 0; i < howMany - 1; i++ ) // one pass
{

if ( seq[ i ] > seq[ i + 1 ] ) // compare a pair of adjacent values
{
//swap
int temp = seq[ i ];
seq[ i ] = seq[ i + 1 ];
seq[ i + 1 ] = temp;
}
}
}
// Function med boublesort som sorterar efter min
double minsort(double howMany, int seq[])
{
for ( int pass = 1; pass <= howMany - 1; pass++ ) // passes

for (int i = 0; i < howMany - 1; i++ ) // one pass
{

if ( seq[ i ] < seq[ i + 1 ] ) // compare a pair of adjacent values
{
//swap
int temp = seq[ i ];
seq[ i ] = seq[ i + 1 ];
seq[ i + 1 ] = temp;
}
}
}

// en function som kollar att "n" är validated för programmet dvs 0<n<=class_size
int checkN(double howMany, int seq[])
{
const int SIZE = 100;
cout << "How big is the sequence: ";
cin >> howMany;


if (howMany > SIZE || howMany < 0)
cout << "Wrong input, max size is 100 and must be largar than 0" << endl;
else
{
for(int i = 0; i < howMany; i++)
cout << seq[i] << endl;

}

return 0;
}
void display_menu()
{
cout << setw(10) << setfill('*') << "*" << endl;
cout << "1. Display shortest" << endl;
cout << "2. Display tallest" << endl;
cout << setw(10) << setfill('*') << "*" << endl << endl;
}

int main()
{

//declare any other needed variables and constants here
int option;
int seq;
string input;
int const SIZE=100;

cout << "Enter the height of each student: ";
cout << endl;
getline(cin, input);
cout << endl;


//Display the menu
display_menu();

cout << "Your option? ";
cin >> option;
switch (option){
//1, Option1 display the height of the n tallest student
//sorted increasingly
case 1:
cout << "Enter n: ";
cin >> seq;
cout << checkN;
break;
//2, Option2 display the height of the n shortest student
//sorted increasingly
case 2:
cout << "Enter n: ";
cin >> seq;
cout << checkN;
break;
//Read user option
//Handle user option
}


return 0;

}

#include <iostream>
#include <iomanip>
#include <string>

using namespace std;


// sparar allt i en array

int elever(int seq[], int howMany)
{

const int STOP = 0;
int count = 0;
int h;
cout << "Enter height of student: "<<endl;
cin>>h;
while(h > STOP)
{
seq[count] = h;
count++;
if (count == howMany)
{
cout<<"fullt"<<endl;
break;
}
cin >> h;
}
return 0;
}
// Function med boublesort som sorterar efter min
double maxsort(int seq[], int howMany)
{
const int SIZE = 100;
int n;
cout << "Enter n: ";
cin >>n;
cout << endl;



for(int y = 1; y <= howMany + 1; y++)
for(int i = 0; i < howMany + 1; i++ )
{

if ( seq[ i ] > seq[ i + 1 ] )
{
int temp = seq[ i ];
seq[ i ] = seq[ i + 1 ];
seq[ i + 1 ] = temp;
}
}
for(int i = 1; i <= howMany; i++)
cout << seq[i-1] << " ";
}


// Function med boublesort som sorterar efter min
double minsort(int seq[], int howMany)
{
int n;
cout<<"enter n?"<<endl;
cin >>n;
for (int y = 1; y <= howMany + 1; y++ )
{
for (int i = 0; i < howMany + 1; i++ )
{
if ( seq[ i ] < seq[ i+1 ] )
{
int temp = seq[ i ];
seq[ i ] = seq[i + 1 ];
seq[ i + 1 ] = temp;
}
}
}
for(int i = n; i > 0; i--)
{
cout << seq[i+1]<<" ";
}
}

// en function som kollar att "n" är validated för programmet dvs 0<n<=class_size
int checkN(int seq[], int howMany)
{

int n;
const int SIZE = 100;
do{
cout << "Enter n ";
cin >> n;
}while(n > SIZE);

return 0;
}

void display_menu()
{
cout << setw(10) << setfill('*') << "*" << endl;
cout << "1. Display shortest" << endl;
cout << "2. Display tallest" << endl;
cout << setw(10) << setfill('*') << "*" << endl << endl;
}

int main()
{
int seq;
const int SIZE=100;

int seq1[SIZE];
int option;
int antal = 0;
int howMany =0;
antal = elever(seq1, SIZE);

//Display the menu
display_menu();

cout << "Your option? ";
cin >> option;
switch (option){
//1, Option1 display the height of the n tallest student
//sorted increasingly
case 1:
checkN(seq1, howMany);
maxsort(seq1, antal);
break;
//2, Option2 display the height of the n shortest student
//sorted increasingly
case 2:
checkN(seq1, howMany);
minsort(seq1, antal);
break;
}
return 0;
}

#include <iostream>
#include <iomanip>
#include <vector>

using namespace std;

void displayInstructions() {
cout << "Enter the height of each student, separated by a new line" << endl
<< "Enter '-1' to finish" << endl;
}

int getSortOrderChoice() {
cout << "Choose your sorting order" << endl
<< " 1. Shortest -> Tallest" << endl
<< " 2. Tallest -> Shortest" << endl;

int sortOrder = 0;
cin >> sortOrder;
cin.clear();
cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');

while (sortOrder != 1 && sortOrder != 2) {
cout << "Please input either 1 or 2" << endl;
cin >> sortOrder;
cin.clear();
cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
}
return sortOrder;
}

int getDataPointsChoice(int maxDataPoints) {
cout << "How many data points to display?" << endl;

int dataPoints = 0;
cin >> dataPoints;
cin.clear();
cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');

while (dataPoints <= 0 || dataPoints > maxDataPoints) {
cout << "Please enter an integer between 1 and " << maxDataPoints << endl;
cin >> dataPoints;
cin.clear();
cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
}
return dataPoints;
}

void enterData(vector<int> &data) {

int dataPoint = 0;

while (cin >> dataPoint && dataPoint != -1) {
data.push_back(dataPoint);
cin.clear();
cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
}
}

void bubbleSort(vector<int> &data, int sortOrder) {

for(unsigned int i = 0; i < data.size(); i++) {
for(unsigned int j = i+1; j < data.size(); j++) {
if(sortOrder == 1) {
if(data[i] > data[j])
swap(data[i], data[j]);
} else {
if(data[i] < data[j])
swap(data[i], data[j]);
}
}
}
}

void printDataPoints(vector<int> &data, int dataPoints) {
data.resize(dataPoints);
for (vector<int>::const_iterator i = data.begin(); i != data.end(); ++i)
cout << *i << " ";
cout << endl;
}

int main(int argc, char* argv) {

vector<int> input;

displayInstructions();
enterData(input);

int sortOrder = getSortOrderChoice();
int dataPoints = getDataPointsChoice(input.size());

bubbleSort(input, sortOrder);

printDataPoints(input, dataPoints);
}