title: How to find the middle element in linked list
body: <p>I need a detailed algorithm , in c# about how to find the middle element in linked List.
  I had checked google and all are talking about the two pointers which moves in parallel over the list . 
  but actually , i couldn't find a detailed solution for the algorithm . and how these two pointers should be implemented .</p>
  
  <p>i need the best solution regarding the performance .</p>