Differences

This shows you the differences between two versions of the page.

--- haas:fall2014:data:projects:dska0-solution [2014/10/31 22:30] – [Linked List Code Inversion] wedge
+++ haas:fall2014:data:projects:dska0-solution [2014/10/31 22:38] (current) – [Linked List Code Inversion] wedge
@@ Line 29: / Line 29: @@
 {{ :haas:fall2014:data:projects:posll0.png |}}
-Note that the NULL terminating the list is to the left of the list start... so again, an inversion or negation what we are used to seeing.
+Note that the NULL terminating the list is to the left of the list start... so again, an inversion or negation of what we are used to seeing.
-The trick here is that we still view this list from left to right-- start is on the left (or beginning), and end is on the right (the contextual end). In this scenario, the connections work against the grain when using the list.
+The trick here is that we still "view" this list from left to right-- start is on the left (or beginning), and end is on the right (the contextual end). In this scenario, the connections work against the grain when using the list.
 =====Appending=====
@@ Line 58: / Line 58: @@
   * **insert()** in a next-oriented singly-linked list is functionally equivalent to **append()** in a previous-oriented singly-linked list
   * **append()** in a next-oriented singly-linked list is functionally equivalent to **insert()** in a previous-oriented singly-linked list
-  * To display the list from start to end in a previous-oriented singly-linked list, we effectively need to perform the **displayb()** logic.
+  * To display the list from start to end in a previous-oriented singly-linked list, we effectively need to use the **displayb()** logic to assist us in our task.
 More precisely, to convert the next-oriented linked-list **insert()** into a previous-oriented linked-list **append()**:
@@ Line 66: / Line 66: @@
 ====positioning tmp====
-You'll see that, instead of seeking from the start of the list, we must seek from the end. And just as with next-insert(), which requires us to get to the node "before", prev-append() has the same need (it is the node before, when commencing from the end).
+You'll see that, instead of seeking from the start of the list, we must seek from the end. And just as with next-insert(), which requires us to get to the node "before", prev-append() has the same need (it is the node that connects to place, and we get here from the end of the list).
 The only difference here (if we were to implement **getpos()/setpos()** functionality), is that when considering list position values, instead of doing:
@@ Line 82: / Line 82: @@
 </code>
+Note the -1 and +1 difference.
 ====navigating with while====
-Obviously, since **getpos()/setpos()** functions were not provided, some sort of repetition is in order (most seemed to go with a while loop, starting from the end of the list-- an excellent choice).
+Obviously, since **getpos()/setpos()** functions were not provided, some sort of repetition is in order (many seemed to go with a while loop, starting from the end of the list-- an excellent choice).
 Likely, something of the form:

Lab46 Wiki

User Tools

Site Tools

Differences

Page Tools