TADM2E 3.23 - Revision history

Abhi204 at 02:24, 13 July 2019

2019-07-13T02:24:36Z

Mbzdmvp: /* Recursive Version 2 (Java) */

2015-01-04T19:21:04Z

‎Recursive Version 2 (Java)

Mbzdmvp: /* Recursive Version 2 (Java) */

2015-01-04T19:16:03Z

‎Recursive Version 2 (Java)

Mbzdmvp: /* Recursive Version 2 (Java) */

2015-01-04T19:15:20Z

‎Recursive Version 2 (Java)

Mbzdmvp: /* Recursive Version 2 (Java) */

2015-01-04T19:06:13Z

‎Recursive Version 2 (Java)

Mbzdmvp at 19:05, 4 January 2015

2015-01-04T19:05:30Z

Mbzdmvp at 19:05, 4 January 2015

2015-01-04T19:05:06Z

Algowikiadmin: Recovering wiki

2014-09-11T18:22:30Z

Recovering wiki

Algowikiadmin: Recovering wiki

2014-09-11T18:13:14Z

Recovering wiki

New page

== Iterative version with three variables ==
<pre>
Node* ReverseList( Node * List )
{
Node *temp1 = *List;
Node * temp2 = NULL;
Node * temp3 = NULL;
while ( temp1 )
{
*List = temp1; //set the head to last node
temp2= temp1->pNext; // save the next ptr in temp2
temp1->pNext = temp3; // change next to privous
temp3 = temp1;
temp1 = temp2;
}
return *List;
}
</pre >

== Iterative version with one variable ==

<pre>
Node* reverse (node* head)
{
node *temp=NULL;
while(true)
{
if(head->next==NULL)
{
head->next=temp;
break;
}
// Swap(head->next, temp)
head->next = (node *)((unsigned long) head->next ^(unsigned long) temp);
temp = (node *)((unsigned long) head->next ^(unsigned long) temp);
head->next =(node *) ((unsigned long) head->next ^ (unsigned long)temp);

// Swap(head, temp)
head = (node *)((unsigned long) head ^(unsigned long) temp);
temp =(node *) ((unsigned long) head ^(unsigned long) temp);
head =(node *) ((unsigned long) head ^ (unsigned long)temp);

}
}
</pre>

== Recursive Version ==

<pre>
Node* Reverse(Node*head)
{
Node* temp=NULL;
if(head==NULL)
{
return NULL;
}
if(head->next==NULL)
return head;
temp=Reverse(head->next);
head->next->next=head;
head->next=NULL;
return temp;
}
</pre>
--[[User:Max|Max]] 07:36, 16 June 2010 (EDT)

@@ Line 80: / Line 80: @@
 		next.reverse(this);
 	next=previousNode;
+}
 </pre>

@@ Line 80: / Line 80: @@
 		next.reverse(this);
 	next=previousNode;
+}
 </pre>

@@ Line 76: / Line 76: @@
+}
-public Node reverse(Node previousNode){
+public void reverse(Node previousNode){
 	if(next!=null)
 		next.reverse(this);
 	next=previousNode;
-	return this;
+	return;
+}
 </pre>

@@ Line 69: / Line 69: @@
 <pre>
-void Reverse(){
+void reverseList(){
 	head.reverse(null);
 	Node temp=head;

@@ Line 69: / Line 69: @@
 <pre>
 public Node reverse(Node previousNode){
 	if(next!=null)

← Older revision		Revision as of 19:05, 4 January 2015
Line 76:		Line 76:
	}		}
	</pre>		</pre>
−	~~--[[User:Moshe\|Moshe 14:03, 04 January 2015 (EDT)~~

← Older revision		Revision as of 19:05, 4 January 2015
Line 65:		Line 65:
	</pre>		</pre>
	--[[User:Max\|Max]] 07:36, 16 June 2010 (EDT)		--[[User:Max\|Max]] 07:36, 16 June 2010 (EDT)
		+
		+	== Recursive Version 2 (Java) ==
		+
		+	<pre>
		+	public Node reverse(Node previousNode){
		+	if(next!=null)
		+	next.reverse(this);
		+	next=previousNode;
		+	return this;
		+	}
		+	</pre>
		+	--[[User:Moshe\|Moshe 14:03, 04 January 2015 (EDT)

@@ Line 1: / Line 1: @@
 == Iterative version with three variables ==
-&lt;pre&gt;
+<pre>
 Node* ReverseList( Node * List )
+{
@@ Line 9: / Line 9: @@
+   {
          *List = temp1; //set the head to last node
-         temp2= temp1-&gt;pNext; // save the next ptr in temp2
+         temp2= temp1->pNext; // save the next ptr in temp2
-         temp1-&gt;pNext = temp3; // change next to privous
+         temp1->pNext = temp3; // change next to privous
          temp3 = temp1;
          temp1 = temp2;
@@ Line 16: / Line 16: @@
     return *List;
+}
-&lt;/pre &gt;
+</pre >
 == Iterative version with one variable ==
-&lt;pre&gt;
+<pre>
 Node* reverse (node* head)
+{
@@ Line 26: / Line 26: @@
      while(true)
+     {
-         if(head-&gt;next==NULL)
+         if(head->next==NULL)
+         {
-             head-&gt;next=temp;
+             head->next=temp;
              break;
+         }
-         // Swap(head-&gt;next, temp)
+         // Swap(head->next, temp)
-         head-&gt;next = (node *)((unsigned long) head-&gt;next ^(unsigned long) temp);
+         head->next = (node *)((unsigned long) head->next ^(unsigned long) temp);
-         temp = (node *)((unsigned long) head-&gt;next ^(unsigned long) temp);
+         temp = (node *)((unsigned long) head->next ^(unsigned long) temp);
-         head-&gt;next =(node *) ((unsigned long) head-&gt;next ^ (unsigned long)temp);
+         head->next =(node *) ((unsigned long) head->next ^ (unsigned long)temp);
          // Swap(head, temp)
@@ Line 43: / Line 43: @@
+     }
+}
-&lt;/pre&gt;
+</pre>
 == Recursive Version ==
-&lt;pre&gt;
+<pre>
 Node* Reverse(Node*head)
+{
@@ Line 56: / Line 56: @@
         return NULL;
+    }
-    if(head-&gt;next==NULL)
+    if(head->next==NULL)
         return head;
-    temp=Reverse(head-&gt;next);
+    temp=Reverse(head->next);
-    head-&gt;next-&gt;next=head;
+    head->next->next=head;
-    head-&gt;next=NULL;
+    head->next=NULL;
     return temp;
+}
-&lt;/pre&gt;
+</pre>
 --[[User:Max|Max]] 07:36, 16 June 2010 (EDT)