c++使用vector容器冒泡排序（偶升序奇降序）

#include 
#include 
using namespace std ;

int main(void)
{
	int i , j;
	vector v1;
	vector v2;
	vector v3;
	
	//cout<<"请输入10个整数。。n";
	v1.push_back(664);
	v1.push_back(335);
	v1.push_back(80);	
	v1.push_back(44);	
	v1.push_back(666);	
	v1.push_back(66);	
	v1.push_back(555);	
	v1.push_back(88);	
	
	for(auto &x:v1)
	{
		if(x%2==0)
			v2.push_back(x);
		else
			v3.push_back(x);
	}
	for(auto &x:v2)
		cout<<"排序前："<v2[j+1])
			{
				int temp;
				temp = v2[j];
				v2[j] = v2[j+1]	;			
				v2[j+1] = temp;//交换
										
			}

		}
	}
	//降序
	for(i = 0 ; i