Talk:Purely functional data structure

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Guild of Copy Editors

This article was copy edited by a member of the Guild of Copy Editors on 30 September 2017.Guild of Copy EditorsWikipedia:WikiProject Guild of Copy EditorsTemplate:WikiProject Guild of Copy EditorsGuild of Copy Editors articles

Info[edit]

This page used to be a redirect to the persistent data srructure page. Purely functional imply persistent byt is not equivalent. This page is based on the former page purely functional Arthur MILCHIOR (talk)

"Memoization" is NOT a typo[edit]

For anyone about to edit this page, please be aware that memoization is a technical term, not a typo.

Why is the citation not sufficient ?[edit]

Isaidnoway (talk · contribs), can you please explain to me the first three "citation needed" you added to ? Purely_functional_data_structure In those three paragraph, a citation is already present, I even added the page number in the book for someone who want to look-up precisely. What more can be done ? For the other paragraphs, no exact citation is indicated, so I'll add citation, to the same book, with the exact page number concerned. It's not going to be too hard, since, for example, there is a chapter called Lazy evaluation, which contains all informations present in wikipedia in the section lazyness and memoization. Similarly concerning your "citation needed" after "the access cost may increase from constant time to to logarithmic time", are the citation in the linked page sufficient ? Because, for example, the page balanced tree already consider the cost of balanced tree there, and thus the statement you ask citation for is only something already explained in details in an other page.Arthur MILCHIOR (talk) 08:09, 3 December 2018 (UTC)[reply]

Arthur MILCHIOR - There is only one single reference in that article supporting all of the content in that article. That's why there is a tag at the top of the article requesting additional citations for verification, which has been there for two years now. More sources and inline citations are ideal. If those citations support the content in those whole paragraphs, then move the citation to the end of the paragraph. There are some external links in that article that could possibly be used as references and/or inline citations for content in the article? Readers need to be able to verify the information they are reading, adding more sources and more inline citations will help our readers to do that. Thanks for your inquiry. Isaidnoway (talk) 09:13, 3 December 2018 (UTC)[reply]

Isaidnoway (talk · contribs) There is a single reference mostly because there have never been another textbook on this subject since the reference I used. Should I use research articles as references ? Because I have got nothing else. However, the research article are more complex to read than the textbook, so adding those reference would make the reader's task more complex, and not more easy. If some readers want more references, they are already given in the textbook, so they can still be verified. But a reader who want just more details and a better understanding should avoid reading the research papers directly, as they are not here to introduce to the domain.

Hash table access time[edit]

The following is not strictly accurate, for a hash table, the average case is O(1) and worst case is O(n). However n is (much) greater than log(n) so I guess it's ok?

But the access cost may increase from constant time to logarithmic time. — Preceding unsigned comment added by Sness (talk • contribs) 01:44, 17 December 2022 (UTC)[reply]