Difference between revisions of "TADM2E 3.20"

From Algorithm Wiki
Jump to: navigation, search
(Recovering wiki)
(No difference)

Revision as of 18:13, 11 September 2014

Node* find_middle(Node *top) {

   int k=0;
   Node *middle=top, *cur=top;
   while (cur) {
       cur = cur->next;
       if (k%2 == 0)
           middle = middle->next;
   return middle;

[Also, can be done by improving one pointer two and one pointer one node(s) at a time. When the two node pointer reaches end, the one node pointer is in the middle.]