Hello, can somebody help me to make this method to run in O(n)
constant time. I think it is running in big O of n square, because of the space. Thank you.
// [[reverse the order of the elements of this list]]
public void reverse()
Node current = tail;
Node next = current.prev;
tail.prev = null;
current.next = next;
Node temp = next;
next = temp.prev;
temp.prev = current;
current = temp;
}while (next != null);
current.next = null;
head = tail;
tail = current;
Last edited by Ana; 12-01-2004 at 06:06 PM.
That is O(n). It only goes once through the list.
Top DevX Stories
Easy Web Services with SQL Server 2005 HTTP Endpoints
JavaOne 2005: Java Platform Roadmap Focuses on Ease of Development, Sun Focuses on the "Free" in F.O.S.S.
Wed Yourself to UML with the Power of Associations
Microsoft to Add AJAX Capabilities to ASP.NET
IBM's Cloudscape Versus MySQL