ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • encroaching lists  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    BIT 28 (1988), S. 775-784 
    ISSN: 1572-9125
    Keywords: F.2.2 ; 68R05 ; sorting ; presortedness ; encroaching lists ; melsort ; permutations
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Encroaching lists are a generalization of monotone sequences in permutations. Since ordered permutations contain fewer encroaching lists than random ones, the number of such listsm provides a measure of presortedness with advantages over others in the literature. Experimental and analytic results are presented to cast light on the properties of encroaching lists. Also, we describe a new sorting algorithm,melsort, with complexityO(nlogm). Thus it is linear for well ordered sets and reduces to mergesort andO(nlogn) in the worst case.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...