#include <iostream>
#include <vector>
#include <execution>
#include <algorithm>
#include <random>

using namespace std ;



int main()
{

	std::vector<int> longVector{ 1,20,3,40,5}  ;
	// Find element using parallel execution policy
	auto result1 = std::find(std::execution::par, std::begin(longVector), std::end(longVector), 2);
	// Sort elements using sequential execution policy
	std::sort(std::execution::seq, std::begin(longVector), std::end(longVector));
    //cout << "longVector:" << longVector << endl ;
    for ( auto x1 : longVector )
     {
		 cout << x1 << " " ;
	 }
	 cout << endl ;
    longVector[0] = 40 ;  longVector[4] = 1 ;
	// Sort elements using parallel
	std::sort(std::execution::par, std::begin(longVector), std::end(longVector));
    for ( auto x1 : longVector )
     {
		 cout << x1 << " " ;
	 }
	 cout << endl ;

	return 1 ;
}