#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

void vektor_bas(vector<int> v){
  for_each(v.begin(), v.end(),[](int &k){cout<< k <<",";});}

int main() {
  vector<int> v{11,12,4,5,11};
  vector<int> sirali_v(v.size());
  copy(v.begin(), v.end(), sirali_v.begin());
  sort(begin(sirali_v), end(sirali_v));
  auto eleman = adjacent_find(begin(sirali_v), end(sirali_v));
  vektor_bas(v);
  if (eleman != end(sirali_v))
    cout << " da ayni eleman: " << *eleman << "\n";
  else
    cout << " da ayni eleman yok" << "\n"; }

> g++ -o program.exe -DDEBUG=9 -ansi -pedantic -Wall -g program.cpp -std=c++11
> ./program.exe
11,12,4,5,11, da aynı eleman: 11

	int[] sayılar = { 1, 10, 2, 2, 3, 8 };
	sayılar.Zip(sayılar.Skip(1), (ilk, ikinci) => ilk + ikinci).GroupBy(x => x).Where(g => g.Count() > 1).ToList().ForEach(z => Console.WriteLine(z.Key));