Draft talk:C3 linearization

This draft 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

Draft

This draft does not require a rating on Wikipedia's content assessment 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}}

Diamond problem?

Is this at all related to the diamond problem? Is it a solution to the diamond problem? Fresheneesz (talk) 04:29, 8 February 2012 (UTC)[reply]

Clarification of "head" and "tails" of list

It might help to clarify what the definition of the "head" and the "tail" of a list is? For example, on the surface, I might assume that, given a list [A, B, C, D, E] that the head is [A] and the tail is [E]. If this is the case, following the rule"...is done by selecting the first head of the lists, which does not appear in the tail of any of the lists.", the example for the C3 linearization of Z would be Step 1: [Z] merge(L(K1), L(K2), L(K3), [K1, K2, K3]) Step 2: [Z] merge([K1,A,B,C,O], [K1,D,B,E,O], [K3,D,A,O], [K1, K2, K3])//all prior linearizations expanded Step 3: [Z, K1] merge([A,B,C,O], [K1,D,B,E,O], [K3,D,A,O], [K2,K3]) Here is where the definition of "head" and "tail" for the lists becomes confusing. If the head is the first element, and tail is the last element, then A should be the next item, however the example shows that K1 is selected next. It would seem that the head is the first element, and the tail is any element that is not the first element? Chrislk02 ^{Chris Kreider} 20:43, 29 April 2015 (UTC)[reply]