"Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + ..."

Stefan Edelkamp, Patrick Stiegeler (2002)

> Home

Details and statistics

DOI: 10.1145/944618.944623

access: closed

type: Journal Article

metadata version: 2020-06-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jea/EdelkampS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jea/EdelkampS02
Stefan Edelkamp, Patrick Stiegeler:
Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) Comparisons. ACM J. Exp. Algorithmics 7: 5 (2002)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.