Anonymous user
Sorting algorithms/Counting sort: Difference between revisions
Sorting algorithms/Counting sort (view source)
Revision as of 21:24, 20 September 2018
, 5 years agoElided the word "anyways" from the last sentence in the task's preamble, strengthened the wording about the use of sparse arrays, also elided a stray comma, cleaned up some wording in the last paragraph, added other wording.
m (→version 1: added/changed whitespace and comments, simplified and optimized a DO loop..) |
(Elided the word "anyways" from the last sentence in the task's preamble, strengthened the wording about the use of sparse arrays, also elided a stray comma, cleaned up some wording in the last paragraph, added other wording.) |
||
Line 26:
The ''min'' and ''max'' can be computed apart, or be known ''a priori''.
'''Note''': we know that, given an array of integers, its maximum and minimum values can be always found; but if we imagine the worst case for an array
<br><br>
|