Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include <list>
- #include <algorithm>
- template <typename T>
- std::set<T> Unija ( const std::set<T> &s1, const std::set<T> &s2)
- { std::set<T> s3;
- auto it1(s1.begin());
- auto it2(s2.begin());
- while (it1!=s1.end() && it2!=s2.end()) {
- if (*it1<*it2)
- s3.insert(*it1++);
- if (*it2<*it1)
- s3.insert(*it2++);
- else
- { s3.insert(*it1++);
- it2++;
- }
- while (it1!=s1.end())
- {
- s3.insert(*it1++);
- }
- while (it2!=s2.end())
- s3.insert(*it2++);
- return s3;
- }
- template <typename selma>
- std::set <selma> Presjek (const std::set<selma> &s1, const std::set<selma> &s2)
- {
- std::set<selma> s3;
- auto it1(s1.begin()); auto it2(s2.begin());
- while (it1!=s1.end() && it2!=s2.end()) {
- if(*it1<*it2)
- it1++;
- if (*it2<*it1)
- it2++;
- else {
- s3.insert(*it1++);
- i2++;
- }
- }
- return s3;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement