Sorting algorithms/Merge sort: Difference between revisions

Content added Content deleted

Inline

@@ Line 2,985: / Line 2,985: @@
 	BEGIN
 		IF next = NIL THEN s(List).next := NIL
-									ELSE s(List).next := next(List) END;
+					  ELSE s(List).next := next(List) END;
 		RETURN s
 	END Set;