Talk:Succinct 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

???

This article has not yet received a rating 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}}

Who's this Jacobson fellow? Sketch-The-Fox 01:29, 27 October 2007 (UTC)[reply]

I edited it and removed the "underlying combinatorial object" jargon, which I think was confusing. When can we remove the note about the Jargon? Smhanov (talk) 02:29, 13 March 2011 (UTC)[reply]

Is a C String Really Implicit?

A C string uses a byte to encode a sequence of characters from a set of 255 alternatives, since the string can't contain 0 as a valid character. Therefore, a n+1 byte (8n+8 bit) C string will be encoding a data structure with entropy log(255)*n. Doesn't this mean that it's in fact a compact data structure? — Preceding unsigned comment added by 212.252.105.234 (talk) 06:26, 21 November 2016 (UTC)[reply]

Is the heap the most known implicit data structure?

Wouldn't the simple array qualify for this position, even though it is a simpler data structure than the heap? — Preceding unsigned comment added by Honeypot95 (talk • contribs) 14:03, 3 February 2020 (UTC)[reply]

I'm pretty sure Union-Find is compact: for every element Z, Union-Find just needs to maintain a parent pointer (and depending on optimizations, also a rank or size counter), making the overall size O(Z). — Preceding unsigned comment added by 2605:A601:A621:3500:C543:DED7:72A2:64F3 (talk) 08:55, 15 July 2023 (UTC)[reply]