
// QuickSort.cpp : 

#include "stdafx.h"
#include 
#include 
#include 
using namespace std;

const int N = 200;
int a[N];

void QuickSort (int L, int P){

	int i = L;
	int k = P;
	int h= a[(L+P)/2];

	while(i <= k){
		while ( a[i] < h) i++;
		while ( a[k] > h) k--;
		if (i<=k)
		{
  		   int p = a[i];
		   a[i] = a[k];
		   a[k] = p;
		   i++;
		   k--;
		}
	}

	if (L a[i+1]) cout << "chyba" <> c;

	return 0;
}