Singly-linked list/Reversal: Difference between revisions
→{{header|J}}
(J) |
|||
Line 48:
=={{header|J}}==
Linked lists in J tend to be tremendously inefficient, and of limited utility. (And, generally speaking, their cache footprint tends to conflict with any theoretical algorithmic gains on
But let's ignore those problems and implement a routine to build us a linked list and then a routine to reverse it:
| |||