An Internal Hybrid Sort Algorithm Revisited | Zendy

Olli Nevalainen | Zendy; T. Raita | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Internal Hybrid Sort Algorithm Revisited

Author(s) -

Olli Nevalainen,

T. Raita

Publication year - 1992

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/35.2.177

Subject(s) - quicksort , sort , computer science , sorting algorithm , algorithm , distributive property , class (philosophy) , bounded function , time complexity , running time , parallel computing , discrete mathematics , mathematics , database , artificial intelligence , mathematical analysis , pure mathematics

Two hybrid methods of distributive sort and quicksort are given. The first method sorts an array of records and the second one sorts a linearly linked list in a stable way. The expected running rime of the methods is O(n) for n records and for a wide class of distributions of the keys (including all bounded densities with a compact support). For most other distributions the running time is O(n log n), and the worst case rime is O(n 2 )

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research