This is a program to sort the VAT in-place using an in-place, non-recursive mergesort. It only uses 29 bytes of external RAM (OP1/OP2 and 4 bytes of stack space), but these constraints grow it to an O(n^2) sorting algorithm instead of the classic O(n*lg(n)) algorithm. However, it starts to perform better than an insertion sort at about 90 elements in this case.
- 2 years ago
- No ratings.
ReviewsNobody has reviewed this file yet.
- VAT Sort - Merge Sort (published 2 years ago; 2018-10-09 23:54 UTC)