#include <iostream>
using namespace std;
//tato verze pouze prehazi licha cisla pred suda
int main()
{
	int i,k, pom;
	int pole[] =
	{
		5,		6,		17,		15,		11,		35,
		42,		24,		30,		44,		36,		43,
		15,		2,		23,		7,		39,		47,
		46,		41,		49,		21
	};
	int N = sizeof(pole)/sizeof(int);

	cout << "\n--------puvodni pole---------\n";
	
	for ( i = 0 ; i < N ; i ++)
	{
		cout << pole[i] << ", ";
	}

	for( i = 0 ; i < N ; i ++ )
	{
		for(k = 0 ; k < N-1-i  ; k ++ )
		{
			if(pole[k]%2 < pole[k+1]%2)
			{
				pom = pole[k];
				pole[k] = pole[k + 1];
				pole[ k + 1 ] = pom;
			}
		}
	}

	cout << "\n--------pole po prehazeni lichych pred suda-----\n";

	for ( i = 0 ; i < N ; i ++ )
	{
		cout << pole[i] << ", ";
	}
}