base:quicksort_16-bit_elements
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
base:quicksort_16-bit_elements [2016-08-18 12:19] – litwr2 | base:quicksort_16-bit_elements [2016-08-19 09:44] – litwr2 | ||
---|---|---|---|
Line 1: | Line 1: | ||
====== Quicksort (for 16-bit Elements) ====== | ====== Quicksort (for 16-bit Elements) ====== | ||
- | by Vladimir Lidovski aka litwr, 13 Aug 2016 | + | by Vladimir Lidovski aka litwr, 13 Aug 2016 (with help of BigEd) |
- | with help of BigEd | + | |
- | It is well known that the best, the fastest sort routine is Quicksort. | + | It is well known that the best, the fastest sort routine is Quicksort. |
The next Pascal code was translated to 6502 assembler. | The next Pascal code was translated to 6502 assembler. | ||
Line 405: | Line 404: | ||
It is required to put the proper constants after // | It is required to put the proper constants after // | ||
+ | The other published 6502 Quicksort is at [[http:// |
base/quicksort_16-bit_elements.txt · Last modified: 2020-10-20 18:53 by litwr2