Anonymous user
Talk:Doubly-linked list/Definition: Difference between revisions
→Python attitude problem
(→Python attitude problem: Not! (For which the expected reply is: is-too!)) |
|||
Line 29:
:[[Tree traversal#Python]] takes a different tack and does show the use of named_tuples in creating a tree of data, but then that task is more than "show the datastructure".
:Of course, one could write a class implementing a doubly linked list in interpreted Python and append it to the Python section of the task, but I think my comment would still hold. --[[User:Paddy3118|Paddy3118]] 07:01, 10 June 2011 (UTC)
::I said, linnked list is for algorithms, not everyday data storage. The value of linked list is that connectivity info is stored on the elements, not the container. What if your job is sorting thought a set of nodes and connectivity rules, and separate nodes or edges into a set of lists to begin with? When you have only local connectivity infomation to work on, you could either use a linked list, or look up who's connected to whom in a dictionary--which is the samething really, the point is: you don't have a nicely indexed list to use yet. It's not like C people prefer linked lists over consecutively indexed arrays if it were possible, but sometimes complexity or efficiency simply won't allow it. -- [[User:Ledrug|Ledrug]] 21:33, 10 June 2011 (UTC)
| |||