litwr2 / 6809-sorting

implementations of various sorting algos for the 6809

6809-sorting

implementations of various sorting algos for the 6809

For each sorting routine the next information is provided: its size, whether it uses stack or not, required amount of additional memory, the size of code for its call. All sizes are in bytes. Benchmark results are clock cycles. One clock cycle is equal to one millionth of a second for the 6809 at 1 MHz. All results were gotten using 6809.c by Arto Salmi and Joze Fabcic.

Quicksort depends on its stacklvl parameter, it must be more than binary logarithm of the number of elements in the sorted array. Number 26 is used as its default value (16 is enough for any case but it is slower). Total amount of stack space required may be calculated by stacklvl*N+stackint where N=6 for quick and N=4 for quick-nr (nr means no recursion), stackint is amount of stack space reserved for interrupts, it can be, for instance, 24 but this value is not used by code. If interrupts are disabled stackint may be equal to 0. You can check if your stack space is large enough before the sort invocation.

Shellsort depends on its shelltabidx parameter which is used in a normal Shellsort invocation. For the benchmarks, the value 7 has been used for 1000 element arrays, and the value 11 has been used for 30000 and 60000 element arrays.

Various kinds of filling have been used for testing and benchmarking:

• random-1 – every byte is generated randomly by the standard C random number generator function, numbers in range 0 and 255 are generated;
• random-2 – every byte is generated randomly by a quick and simple homebrew random number generator, numbers in range 0 and 255 are generated;
• 2-values – every byte is generated randomly by the standard C random number generator function, only numbers 0 and 1 are generated;
• 4-values – every 16-bit word is generated randomly by the standard C random number generator function, only numbers 0, 1, 256 and 257 are generated;
• killer-qs-r – this sequence kills Hoare's Quicksort from its right edge;
• killer-qs-l – this sequence kills Hoare's Quicksort from its left edge;
• reversed – every next element is equal or lower than the previous;
• sorted – every next element is equal or higher than the previous;
• constant – all elements are equal.

The killer sequence generators may be taken from this file, seek for fill_for_quadratic_qsort_hoare routines. The random-2 generator is available within the same file, seek for fill_homebrew_randomly routine.

The standard C random generator (GCC) is initializared with srand(0).

Byte sorting

Routine	Size	Stack	Memory	Startup
quick	147	182¹	0	9
quick-nr	170	130²	0	9
shell	113	2	0	13
selection	45	2	0	9
insertion	47	2	0	10
radix8	77	10	512	13

¹ - stacklvl*6+stackint+2

² - stacklvl*4+stackint+2

1000 byte benchmarking

	quick	quick-nr	shell	selection	insertion	radix8
random-1	414,862	423,284	614,823	13,570,105	11,890,464	81,557
random-2	417,901	420,812	589,522	13,566,403	9,260,526	81,557
2-values	432,288	418,352	326,206	13,543,567	5,778,896	81,581
reversed	324,243	349,578	442,004	13,934,953	23,428,030	81,557
sorted	303,452	328,676	285,279	13,540,525	45,001	81,557
constant	397,565	387,890	285,279	13,540,525	45,001	81,593

60000 byte benchmarking

	quick	quick-nr	shell	selection	insertion	radix8
random-1	37,875,485	37,068,826	54,410,577	48,604,259,341	42,120,340,195	4,329,785
random-2	38,059,626	37,250,476	52,145,357	48,604,306,471	42,068,605,691	4,330,745
2-values	39,838,004	38,956,490	31,145,859	48,602,611,093	21,058,278,682	4,332,353
reversed	30,562,025	29,967,542	39,513,594	48,625,574,707	84,270,682,710	4,329,785
sorted	29,324,748	28,731,481	28,131,687	48,602,430,025	2,700,001	4,329,785
constant	38,280,165	37,657,626	28,131,687	48,602,430,025	2,700,001	4,332,365

Word sorting

Routine	Size	Stack	Memory	Startup
quick	152	182¹	0	9
quick_nr	175	130²	0	9
shell	114	2	0	13
selection	48	2	0	9
insertion	52	2	0	10

1000 word benchmarking

	quick	quick-nr	shell	selection	insertion
random-1	528,477	553,341	754,225	15,577,147	15,266,405
random-2	527,916	549,383	712,162	15,578,965	13,499,185
4-values	500,697	484,958	396,139	15,550,981	12,149,599
kill-qs-r	941,358	932,396	616,567	15,555,091	10,386,242
kill-qs-l	2,227,182	1,028,651	613,867	15,553,501	10,386,103
reversed	290,945	281,270	521,890	17,044,525	31,003,012
sorted	268,317	258,642	311,167	15,544,525	48,997
constant	452,233	442,558	311,167	15,544,525	48,997

30000 word benchmarking

	quick	quick-nr	shell	selection	insertion
random-1	21,075,830	21,726,546	37,441,589	13,952,910,949	13,964,986,018
random-2	20,933,846	21,348,596	35,824,820	13,952,845,117	13,937,815,243
4-values	21,437,234	21,012,461	17,459,669	13,951,529,755	10,599,299,071
kill-qs-r	37,226,256	36,826,474	30,347,921	13,951,654,177	9,301,524,790
kill-qs-l	72,657,840	45,701,703	30,247,891	13,951,605,001	9,301,524,651
reversed	12,234,963	11,923,720	23,578,009	15,301,335,025	27,900,090,012
sorted	11,559,718	11,248,475	14,849,043	13,951,335,025	1,469,997
constant	20,529,725	20,218,486	14,849,043	13,951,335,025	1,469,997

Check also Z80-sorting, 6502-sorting, and Benchmark Comparisons.