| Webster's Online Dictionary |
| Domain | Definition | ||
| Math | A sort algorithm which builds a heap, then repeatedly extracts the maximum item. Run time is O (n log n). (references) | ||
Source: compiled by the editor from various references; see credits. | Top | ||
Topics by Level of Interest: HEAPSORT | ||||
| Topics sorted by level of Interest | Level (1=low, 600=high) | Topics sorted Alphabetically | Level (1=low, 600=high) | |
| Heapsort | 21 | Heapsort | 21 | |
Source: the editor, created by/for EVE to gauge likely levels of human interest in linguistically triggered topics (compiled across various sources, such as Wikipedia and specialty expression glosses). | ||||