|
Ubiquitous Z80 QuickSort Implementation
|
|
FILE INFORMATION
Ranked as 25370 on our all-time top downloads list with 2342 downloads.
Ranked as 2806 on our top downloads list for the past seven days with 6 downloads.
Ranked as 243 on our top rated list with a weighted average of 8.28.
|
qsort.zip
|
|
Filename
|
qsort.zip (Download)
|
|
Title
|
Ubiquitous Z80 QuickSort Implementation
|
|
Description
|
This routine is quicksort, the fastest sorting algorithm currently out there. It sorts stuff in ascending order, and a demo is included. Just plug the start and end indexes of the list to bc and de, and you're set. Simple and small (<41 instructions, 90 bytes) and really, really fast (200 elements in an unnoticable amount of time). It works for all Z80 processors, all calcs, cellphones, and whatever, though the demo is for the 86. But like all quicksorts, it uses the stack, although I made the recursion structure a little less stack expensive.
|
|
Author
|
Frank Yaul ()
|
|
Category
|
TI-86 Assembly Routines
|
|
File Size
|
97,491 bytes
|
|
File Date and Time
|
Sat Jul 24 20:47:31 2004
|
|
Documentation Included?
|
Yes
|
|
SCREEN SHOTS
REVIEWS
There are no reviews for this file.
LEAVE FEEDBACK
Questions, comments, and problems regarding the file itself should be sent directly to the author(s) listed above.
Write a review for this file (requires a free account)
Report inappropriate or miscategorized file (requires an account; or you may email us directly)
If you have downloaded and tried this program, please rate it on the scale below
ARCHIVE CONTENTS
|
|
|
