Linked Lists/Java/Reverse - Revision history

Admin: /* Profiling */

2019-02-13T06:24:36Z

Profiling

← Older revision		Revision as of 06:24, 13 February 2019
Line 73:		Line 73:

	[[Image:rev_amortized.png\|500px]]		[[Image:rev_amortized.png\|500px]]

			X Axis: N (number of elements in linked list)

			Y Axis: Amortized wall time, microseconds (total walltime / N)

	[[Image:rev_walltime.png\|500px]]		[[Image:rev_walltime.png\|500px]]

			X Axis: N (number of elements in linked list)

			Y Axis: Total walltime, ms

	==Flags==		==Flags==

2019-02-13T06:22:05Z

Profiling

← Older revision		Revision as of 06:22, 13 February 2019
Line 70:		Line 70:
	Here are the total walltime costs and per operation costs for the remove operation defined in the TLinkedList class above.		Here are the total walltime costs and per operation costs for the remove operation defined in the TLinkedList class above.

	Code to make these figures is here: https://charlesreid1.com~~:3000~~/cs/java/src/master/lists/linked-lists/Timing.java		Code to make these figures is here: https://git.charlesreid1.com/cs/java/src/master/lists/linked-lists/Timing.java

	[[Image:rev_amortized.png\|500px]]		[[Image:rev_amortized.png\|500px]]

2019-02-13T06:21:52Z

Code

← Older revision		Revision as of 06:21, 13 February 2019
Line 64:		Line 64:
	</pre>		</pre>

	Link to full implementation of TLinkedList class: https://charlesreid1.com~~:3000~~/cs/java/src/master/lists/linked-lists/TLinkedList.java		Link to full implementation of TLinkedList class: https://git.charlesreid1.com/cs/java/src/master/lists/linked-lists/TLinkedList.java

	==Profiling==		==Profiling==

2019-02-13T06:19:33Z

Question

2017-06-06T04:55:44Z

Profiling

← Older revision		Revision as of 04:55, 6 June 2017
Line 69:		Line 69:
	==Profiling==		==Profiling==

	Here are the total walltime costs and per operation costs for the ~~Linked List type~~ defined in TLinkedList:		Here are the total walltime costs and per operation costs for the remove operation defined in the TLinkedList class above.

			Code to make these figures is here: https://charlesreid1.com:3000/cs/java/src/master/lists/linked-lists/Timing.java

	[[Image:rev_amortized.png\|500px]]		[[Image:rev_amortized.png\|500px]]

2017-06-06T04:53:18Z

Code

← Older revision		Revision as of 04:53, 6 June 2017
Line 67:		Line 67:
	Link to full implementation of TLinkedList class: https://charlesreid1.com:3000/cs/java/src/master/lists/linked-lists/TLinkedList.java		Link to full implementation of TLinkedList class: https://charlesreid1.com:3000/cs/java/src/master/lists/linked-lists/TLinkedList.java

			==Profiling==

			Here are the total walltime costs and per operation costs for the Linked List type defined in TLinkedList:

			[[Image:rev_amortized.png\|500px]]

			[[Image:rev_walltime.png\|500px]]

	==Flags==		==Flags==

2017-06-06T04:40:46Z

@@ Line 1: / Line 1: @@
 Skiena Chapter 3: Data Structures
@@ Line 37: / Line 40: @@
 </pre>
 =Flags=
 {{DataStructuresFlag}}

2017-06-05T05:38:52Z

2017-06-05T05:19:02Z

← Older revision		Revision as of 05:19, 5 June 2017
Line 1:		Line 1:
			Skiena Chapter 3: Data Structures

			'''Question 3-2) Write a program to reverse the direction of a singly linked list in O(n) time. '''

	To reverse a linked list, need to hang on to three separate pointers:		To reverse a linked list, need to hang on to three separate pointers:
	* One pointer is the runner, which points to the current node being "fixed" (reversed in place).		* One pointer is the runner, which points to the current node being "fixed" (reversed in place).

2017-06-05T05:18:26Z