#include <iostream>
using namespace std;

void SortimiVargutMin(int A[], int k)
{
	for (int i = 0; i<k; i++)
	{
		for (int j = 0; j<(k - 1); j++)
		{
			if (A[j]>A[j + 1])
			{
				int temp = A[j];
				A[j] = A[j + 1];
				A[j + 1] = temp;
			}
		}

	}
}

void SortimiVargutMax(int A[], int k)
{
	for (int i = 0; i<k; i++)
	{
		for (int j = 0; j<(k - 1); j++)
		{
			if (A[j]<A[j + 1])
			{
				int temp = A[j];
				A[j] = A[j + 1];
				A[j + 1] = temp;
			}
		}

	}
}


void Shfaq(int A[], int k)
{
	for (int i = 0; i<k; i++)
	{
		cout << A[i] << ", ";
	}

}
void GjejSipasIndex(int A[], int k)
{
	int x, i;
	cout << "Cilin index doni ta gjeni: ";
	cin >> x;

	for (int i = 0; i<k; i++)
	{
		if (i == x)
		{
			cout << "Indexi per elementin qe kerkuat eshte : " << A[i] << endl;
		}
	}
}

int main()
{
	int k;
	cout << "Jep gjatesine e vargut: ";
	cin >> k;
	int A['k'];

	for (int i = 0; i<k; i++)
	{
		cout << "Jep vleren : ";
		cin >> A[i];
	}

	cout << "Vargu fillestar: " << endl;
	Shfaq(A, k);

	SortimiVargutMin(A, k);
	cout << "Vargu i sortuar minimalisht:  " << endl;
	Shfaq(A, k);

	SortimiVargutMax(A, k);
	cout << "Vargu i sortuar max:  " << endl;
	Shfaq(A, k);

	GjejSipasIndex(A, k);

}