Revision as of 06:11, 23 February 2022 edit Willondon (talk \| contribs) Extended confirmed users, Pending changes reviewers 57,371 edits Undid revision 1073529361 by 12.185.151.20 (talk); previous was correct Tag: Undo ← Previous edit		Revision as of 20:51, 12 May 2022 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,832 edits →Presortedness measures: replace conference with journal version (LNCS is not a journal) Next edit →
Line 181: === Presortedness measures === {{refbegin}} {{cite journal {{cite journal\|journal=Lecture Notes in Computer Science\|year=1984\|volume=172\|pages=324–336\|doi=10.1007/3-540-13345-3_29\|title=Measures of presortedness and optimal sorting algorithms\|first=Heikki\|last=Mannila\|isbn=978-3-540-13345-2\|authorlink=Heikki Mannila}} \| last = Mannila \| first = Heikki \| author-link = Heikki Mannila \| date = April 1985 \| doi = 10.1109/tc.1985.5009382 \| issue = 4 \| journal = IEEE Transactions on Computers \| pages = 318–325 \| title = Measures of presortedness and optimal sorting algorithms \| volume = C-34}} * {{cite journal\|first1=Vladimir\|last1=Estivill-Castro\|first2=Derick\|last2=Wood\|author2-link=Derick Wood\|title=A new measure of presortedness\|journal=Information and Computation\|volume=83\|issue=1\|pages=111–119\|year=1989\|doi=10.1016/0890-5401(89)90050-3\|doi-access=free}} * {{cite journal\|first=Steven S.\|last=Skiena\|year=1988\|title=Encroaching lists as a measure of presortedness\|journal=BIT\|volume=28\|issue=4\|pages=755–784\|doi=10.1007/bf01954897\|s2cid=33967672}}

Inversion (discrete mathematics): Difference between revisions