#include <iostream>
using namespace std;
void input (int ulist[26], int& n);
void Bubblesort (int ulist[26], int slist[26], int n);
void print(int list[26], int n);
double average;int n,sum;
void main()
{
	int ulist[26], slist[26];
	input(ulist, n);
	cout << "Unsorted" ;
	print(ulist, n);
	cout << "Sorted";
	Bubblesort (ulist,slist,n);
	print(slist,n);
}
void input(int ulist[26], int& n)            
{
	int i(0),value;
	cout << "enter value : \n";
	cin >> value ;

	while (i < 26 && value != -999)
	{
		i++;
		ulist[i] = value;
		if (i<26)
		{
		cin >> value ;
		}
	}
	n=i;
}
void Bubblesort(int unlist[26], int sortlist[26], int n)
{
	int i,j,temp;
	for (i=1;i<=n;i++)
			sortlist[i] = unlist [i];
	for (j=1;j<=n-1;j++)
		for (i=1;i<=n-j;i++)
			if (sortlist[i] > sortlist[i+1])
			{
				temp = sortlist[i];
				sortlist[i] = sortlist[i+1];
				sortlist[i+1] = temp;
			}
}
void print(int list[26], int n)
{
	int i;
	sum = 0;
	cout << " list of numbers are : \n";
	for (i=1; i<=n; ++i)
	{
		cout << list[i] << '\n';
		sum = sum + list[i];
	}
		average = sum/n;
		cout << "\n\n";
	    cout << "Average is "<< average << "\n";
}

	if (sortlist[i] > sortlist[i+1])

void sort(int g[], int s[], int b[], int index[], int n){
	int i, temp, pass, flip = 1;

	for (pass = 0; (pass < n - 1) && (flip == 1); pass++){
	    flip = 0;
	    for (i = 0; i < n-1; i++){
		if (g[index[i]] + s[index[i]] + b[index[i]] < g[index[i + 1]] + s[index[i + 1]] + b[index[i + 1]]){
		   flip = 1;
		   temp = index[i];
		   index[i] = index[i + 1];
		   index[i + 1] = temp;
		}
	    }
	}
   }