C++挖去数组最小

缘由https://bbs.csdn.net/topics/395279595

	int a = 1, aa[] = { 7, 0, 2, 3, 4, 5, 6, 1 }, b = sizeof(aa) / sizeof(aa[0]), bb = 0;
	while (a<b)if (aa[bb]<aa[b - a])bb = a, ++a; else bb = b - a, ++a;
	while (bb<b)aa[bb] = aa[bb + 1], ++bb;
	a = 0; while (a<b - 1)cout << aa[a++]<<"\t";