(computing theory) A sorting algorithm based on heapsort but using the Leonardo numbers, tending to perform better than heapsort in cases where the items to be sorted are already partially sorted..
현재 검증된 한국어 뜻은 준비 중이며 영어 정의는 “(computing theory) A sorting algorithm based on heapsort but using the Leonardo numbers, tending to perform better than heapsort in cases where the items to be sorted are already partially sorted.”입니다.