Talk:Self-organizing list

Self-organising heuristic was nominated for deletion. The discussion was closed on 3 January 2024 with a consensus to merge. Its contents were merged into Self-organizing list. The original page is now a redirect to this page. For the contribution history and old versions of the redirected article, please see its history; for its talk page, see here.

Untitled[edit]

Could someone please expand on this, like a couple methods for creating one?

Cleanup needed![edit]

Hi Saurabh, Your entry reads like a textbook, not like an encyclopedic entry. You need to :

find more works on the subject.
give more references.
cut out anything that is technical and does not belong in an encyclopedia article.
your entire section 3 needs to be rewritten in prose with minimal details & all those equations in section 2 need to go unless they are relevant. No derivations here please.

However, your entry in its present shape is more suitable for English Wikiversity. You may like to create a page there too.

Warm regards, AshLin (talk) 13:20, 12 September 2011 (UTC)[reply]

Rating this as start class. The previous comments are still entirely relevant and substantial work is required. 110.174.44.126 (talk) 05:53, 17 April 2020 (UTC)[reply]

Space complexity of move-ahead-k[edit]

The article claims "Doing so would require a constant cost of storing last k pointers of the linked list.", which is an accurate portrayal of what the Hester source says.

Unfortunately, the source is wrong. You only need to store a single additional pointer, which lags behind the current by $k$ (which need not be constant, as long as $i-k$ is monotonically increasing). This is reminiscent of the well-known Floyd's cycle-finding algorithm, where the "tortoise" advances every other step that the "hare" takes. Here, our "tortoise" would remain still for the first $k$ steps, then advance at the same rate as the "hare".

I'm not sure where we would find a published source for this kind of thing, but my description should be sufficient for any programmer to figure it out.

--o11c (talk) 01:11, 9 January 2022 (UTC)[reply]

India Education Program course assignment[edit]

This article was the subject of an educational assignment at College Of Engineering Pune supported by Wikipedia Ambassadors through the India Education Program during the 2011 Q3 term. Further details are available on the course page.

The above message was substituted from {{IEP assignment}} by PrimeBOT (talk) on 20:04, 1 February 2023 (UTC)[reply]