Difference between revisions of "LL To RArray"
(removed D cat) |
|||
Line 1: | Line 1: | ||
− | == LL_To_RArray( LL, indexName ) == | + | == LL_To_RArray(LL, indexName) == |
− | + | Converts a linked list «LL» to an array. A new local index is created having a length equal to the number of items in the linked list, with the name «indexName» (i.e., «indexName» is a text parameter). The items in the array are in the reverse order that they appear in the linked list, which means that they are in the same order that they were pushed onto the front of the linked list. | |
− | Converts a linked list to an array. A new local index is created having a length equal to the number of items in the linked list, with the name «indexName» (i.e., «indexName» is a text parameter). The items in the array are in the reverse order that they appear in the linked list, which means that they are in the same order that they were pushed onto the front of the linked list. | ||
== Examples == | == Examples == | ||
+ | :<code>Var n := 27;</code> | ||
+ | :<code>Var LL := null;</code> | ||
+ | :<code>While (n > 1) do (</code> | ||
+ | :<code>LL := LL_Push(LL, n);</code> | ||
+ | :<code>n := If Mod(n, 2) Then 3*n + 1 Else n/2</code> | ||
+ | :<code>);</code> | ||
+ | :<code>LL_To_RArray(LL, "step") →</code> | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
:[[image:Start_3n+1_from_27.png]] | :[[image:Start_3n+1_from_27.png]] | ||
::: ⋮ | ::: ⋮ | ||
Line 19: | Line 16: | ||
== See Also == | == See Also == | ||
− | |||
* [[LL_To_Array]] | * [[LL_To_Array]] | ||
* [[Linked list library]] | * [[Linked list library]] | ||
* [[LL_Push]] | * [[LL_Push]] | ||
+ | * [[Mod]] |
Revision as of 02:05, 29 January 2016
LL_To_RArray(LL, indexName)
Converts a linked list «LL» to an array. A new local index is created having a length equal to the number of items in the linked list, with the name «indexName» (i.e., «indexName» is a text parameter). The items in the array are in the reverse order that they appear in the linked list, which means that they are in the same order that they were pushed onto the front of the linked list.
Examples
Var n := 27;
Var LL := null;
While (n > 1) do (
LL := LL_Push(LL, n);
n := If Mod(n, 2) Then 3*n + 1 Else n/2
);
LL_To_RArray(LL, "step") →
See Also
Comments
Enable comment auto-refresher