Heap Sort
This is a heap sort algorithm that implements an array as a heap, sorts as many as 10000 numbers that are randomly generated and writes them to a file called "heap.out".
AI
AI 요약: This codebase represents a historical implementation of the logic described in the metadata. Our preservation engine analyzes the structure to provide context for modern developers.
소스 코드
Upload
원본 댓글 (3)
Wayback Machine에서 복구됨