[ counting sort ideea... ]
have a data structure and also i have 3 basic operation, find_min,
delete_min and insert .
A sequence of m operation could look like this:
insert,insert,insert,delete,find_min....etc..
Any M operations of these, should have O(M+k) complexity( O(m+k) -worst
case).
My ideea is to have a sorted array, so the minimum would be on the
first position so the complexity would be O(1) for find_min and delete.
But i don't know what to do with insert . Any clues ?
.
Relevant Pages
- Re: For Sean Pitman: Review of "Meaningful Information"
... Shakespeare play as any other sequence. ... isn't the same thing as compression with use of a formula like Pi or ... S has a complexity of one bit when CS is taken as reference computer. ...
(talk.origins) - Re: Of Mice and Straw Men
... examples of template-based evolution where improved binding to another ... pre-established sequence result in increased selectability. ... these examples end up beyond very low levels of functional complexity. ... requirements that go beyond a few hundred fairly specified residues. ...
(talk.origins) - Re: For Sean Pitman: Review of "Meaningful Information"
... Can you explain how that is relevant to Kolmogorov Complexity? ... compressibility of various types of patterns. ... have access to a code that contains a much longer sequence. ... RRRRRRRRBBBBBBBB ...
(talk.origins) - Re: Cascading vs. Specified Systems
... functional sequence to a different functional sequence is NOT random ... This change is completed by random mutation alone. ... The real question is how "target rich" the environment of genetics ... 1000aa level of functional complexity. ...
(talk.origins) - Re: For Sean Pitman: Review of "Meaningful Information"
... Shakespeare play as any other sequence. ... S has a complexity of one bit when CS is taken as reference computer. ... Finite strings have an algorithmic complexity that depends on the ...
(talk.origins) |
|
