Insert a sorted range into another sorted range, better solution.

sorted_insert.cpp

template<typename Iterator1, typename Iterator2>
void sorted_insert(Iterator1 first_begin,
				   Iterator1 first_end,
				   Iterator2 second_begin,
				   Iterator2 second_end,
				   Iterator2 buffer_end)
{
	--first_begin;
	--first_end;
	--second_end;
	--buffer_end;
	
	for ( ; first_end != first_begin; --buffer_end)
	{
		if (*first_end > *second_end) *buffer_end = *first_end--;
		
		else *buffer_end = *second_end--;
	}
}