The problem is:

Given two sorted lists, L1 and L2, then how i write a procedure to compute L1 n L2 (intersection) ?

can anyone help me , please?

## ddanbe 2,720

Mitja Bonca
commented:
Linq is the best option :) +2

## Mitja Bonca 557

ddanbe
commented:
Could not give rep to your next post so I do it here. +9