void bucketSort(int a[], int l)
	{
		int min = a[0];
		int max = a[0];
		for (int i = 1; i < l; i++)
		{
			if (a[i] > max)
				max = a[i];
			if (a[i] < min)
				min = a[i];
		}
		int bi = max - min + 1;
		vector<int>* b = new vector<int>[bi];
		for (int i = 0; i < bi; i++) b[i] = vector<int>();
		for (int i = 0; i < l; i++) b[a[i] - min].push_back(a[i]);
		int k = 0;
		for (int i = 0; i < bi; i++)
		{
			int bn = b[i].size();

			if (bn > 0)
			{
				for (int j = 0; j < bn; j++)
				{
					a[k] = b[i][j];
					k++;
				}
			}
		}
	}